9532 search results - page 148 / 1907 » Logic, Graphs, and Algorithms |
LATIN
2004
Springer
15 years 4 months ago
2004
Springer
For several graph-theoretic parameters such as vertex cover and dominating set, it is known that if their sizes are bounded by k then the treewidth of the graph is bounded by some ...
SWAT
1992
Springer
15 years 3 months ago
1992
Springer
We obtain the rst NC algorithm for the low-diameter graph decomposition problem on arbitrary graphs. Our algorithm runs in O(log5 (n)) time, and uses O(n2) processors.
CDC
2008
IEEE
15 years 5 months ago
2008
IEEE
Abstract— We study averaging algorithms, when implemented in large networks of wirelessly connected elements. We extend the notion of “Increasing Correctness” (IC) which was ...
102
click to vote
JALC
2002
14 years 11 months ago
2002
We define general algebraic frameworks for shortest-distance problems based on the structure of semirings. We give a generic algorithm for finding single-source shortest distances...
GD
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...