Sciweavers

1729 search results - page 39 / 346
» Bound Graph Polysemy
Sort
View
146
Voted
FOCS
2006
IEEE
15 years 10 months ago
Lower Bounds for Additive Spanners, Emulators, and More
An additive spanner of an unweighted undirected graph G with distortion d is a subgraph H such that for any two vertices u, v ∈ G, we have δH(u, v) ≤ δG(u, v) + d. For every...
David P. Woodruff
WINE
2009
Springer
83views Economy» more  WINE 2009»
15 years 11 months ago
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs
Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gw...
117
Voted
FOCS
2007
IEEE
15 years 11 months ago
Testing Expansion in Bounded-Degree Graphs
Artur Czumaj, Christian Sohler
91
Voted
COCO
2005
Springer
79views Algorithms» more  COCO 2005»
15 years 10 months ago
Bounded Color Multiplicity Graph Isomorphism is in the #L Hierarchy
Vikraman Arvind, Piyush P. Kurur, T. C. Vijayaragh...