Sciweavers

723 search results - page 34 / 145
» On the hyperbolicity constant in graphs
Sort
View
STOC
2006
ACM
186views Algorithms» more  STOC 2006»
16 years 6 months ago
A subset spanner for Planar graphs, : with application to subset TSP
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
Philip N. Klein
SCAM
2008
IEEE
16 years 17 days ago
Change Impact Graphs: Determining the Impact of Prior Code Changes
The source code of a software system is in constant change. The impact of these changes spreads out across the software system and may lead to the sudden manifestation of failures...
Daniel M. Germán, Gregorio Robles, Ahmed E....
COMBINATORICS
2006
126views more  COMBINATORICS 2006»
15 years 6 months ago
The Induced Subgraph Order on Unlabelled Graphs
A differential poset is a partially ordered set with raising and lowering operators U and D which satisfy the commutation relation DU-UD = rI for some constant r. This notion may ...
Craig A. Sloss
ESA
2009
Springer
149views Algorithms» more  ESA 2009»
16 years 23 days ago
Sparse Cut Projections in Graph Streams
Finding sparse cuts is an important tool for analyzing large graphs that arise in practice, such as the web graph, online social communities, and VLSI circuits. When dealing with s...
Atish Das Sarma, Sreenivas Gollapudi, Rina Panigra...
INFOCOM
2011
IEEE
14 years 9 months ago
Approximate distance queries and compact routing in sparse graphs
—An approximate distance query data structure is a compact representation of a graph, and can be queried to approximate shortest paths between any pair of vertices. Any such data...
Rachit Agarwal, Philip Brighten Godfrey, Sariel Ha...