Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

17

FAW
2010
Springer

favoriteEmaildiscussreport

217views Algorithms» more FAW 2010»

Path Separability of Graphs

13 years 2 months ago

Path Separability of Graphs

Download hal.archives-ouvertes.fr

In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several graph families having such path separability, and we show that this property is closed under minor taking. In particular we establish a list of forbidden minors for 1-path separable graphs.

Emilie Diot, Cyril Gavoille

Real-time Traffic

Algorithms | FAW 2010 | K-path Separable Graphs | Shortest Paths | Structural Properties |

claim paper

Related Content

» Object location using path separators

» IOEfficient Planar Separators

» Separation dimension and facet algorithms for node flow polyhedra

» Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar Digraphs

» Spanners for Geometric Intersection Graphs

» AverageCase Analyses of Vickrey Costs

» PathSys integrating molecular interaction graphs for systems biology

» An External Memory Data Structure for Shortest Path Queries

» Sharp Separation and Applications to Exact and Parameterized Algorithms

Post Info
More Details (n/a)

Added	25 Jan 2011
Updated	25 Jan 2011
Type	Journal
Year	2010
Where	FAW
Authors	Emilie Diot, Cyril Gavoille

Comments (0)