Selecting vertex disjoint paths in plane graphs.
Holger FlierMatús MihalákPeter WidmayerAnna ZychYusuke KobayashiAnita SchöbelPublished in: Networks (2015)
Keyphrases
- disjoint paths
- undirected graph
- directed graph
- approximation algorithms
- spanning tree
- directed acyclic graph
- graph structure
- connected components
- random graphs
- complex networks
- minimum cost
- random walk
- vertex set
- three dimensional
- graph structures
- average degree
- labeled graphs
- data structure
- attributed graphs
- strongly connected
- minimum weight
- association rules
- xml documents
- special case
- d objects