2270 search results - page 163 / 454 » On the distribution of eigenvalues of graphs |
148
click to vote
JPDC
2008
15 years 6 months ago
2008
We present a scalable framework for parallelizing greedy graph coloring algorithms on distributed-memory computers. The framework unifies several existing algorithms and blends a ...
170
click to vote
TDSC
2008
15 years 6 months ago
2008
The probabilistic packet marking (PPM) algorithm is a promising way to discover the Internet map or an attack graph that the attack packets traversed during a distributed denial-of...
207
click to vote
INFOCOM
2011
IEEE
14 years 10 months ago
2011
IEEE
—Extracting planar graph from network topologies is of great importance for efficient protocol design in wireless ad hoc and sensor networks. Previous techniques of planar topol...
168
click to vote
COMPGEOM
2006
ACM
16 years 12 days ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
142
click to vote
SC
1995
ACM
15 years 10 months ago
1995
ACM
Recently, a number of researchers have investigated a class of algorithms that are based on multilevel graph partitioning that have moderate computational complexity, and provide ...