Vertex disjoint paths on clique-width bounded graphs.
Frank GurskiEgon WankePublished in: Theor. Comput. Sci. (2006)
Keyphrases
- disjoint paths
- undirected graph
- directed graph
- graph properties
- approximation algorithms
- spanning tree
- graph structure
- directed acyclic graph
- random graphs
- connected components
- vertex set
- minimum cost
- complex networks
- random walk
- maximum clique
- bounded treewidth
- edge weights
- independent set
- attributed graphs
- maximum weight
- np hard
- average degree
- gray level