144 search results - page 1 / 29 » Path extendability of claw-free graphs |
WG
2009
Springer
13 years 11 months ago
2009
Springer
WG
2010
Springer
13 years 2 months ago
2010
Springer
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...
TVCG
2011
12 years 12 months ago
2011
—Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place t...
DAM
2011
12 years 12 months ago
2011
In 1988, Golumbic and Hammer characterized powers of cycles, relating them to circular-arc graphs. We extend their results and propose several further structural characterizations ...
SIAMCOMP
2010
12 years 11 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...