Vertex Disjoint Paths on Clique-Width Bounded Graphs.
Frank GurskiEgon WankePublished in: LATIN (2004)
Keyphrases
- disjoint paths
- undirected graph
- directed graph
- graph properties
- approximation algorithms
- spanning tree
- random graphs
- graph structure
- directed acyclic graph
- complex networks
- connected components
- minimum cost
- random walk
- maximum clique
- quasi cliques
- vertex set
- independent set
- labeled graphs
- np hard
- attributed graphs
- special case
- weighted graph
- optimal solution
- objective function
- social networks