1105 search results - page 120 / 221 » Linear choosability of graphs |
143
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Abstract. Consider a weighted and undirected graph, possibly with self-loops, and its corresponding Laplacian matrix, possibly augmented with additional diagonal elements correspon...
152
click to vote
SIGCOMM
1998
ACM
15 years 8 months ago
1998
ACM
Many emerging applications (e.g., teleconference, real-time information services, pay per view, distributed interactive simulation, and collaborative work) are based upon a group ...
159
click to vote
KDD
2009
ACM
16 years 5 months ago
2009
ACM
Classifying nodes in networks is a task with a wide range of applications. It can be particularly useful in anomaly and fraud detection. Many resources are invested in the task of...
167
click to vote
IPPS
1999
IEEE
15 years 8 months ago
1999
IEEE
In order to extract high levels of performance from modern parallel architectures, the effective management of deep memory hierarchies is very important. While architectural advan...
123
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...