Splitting a graph into disjoint induced paths or cycles.
Hoàng-Oanh LeVan Bang LeHaiko MüllerPublished in: Discret. Appl. Math. (2003)
Keyphrases
- pairwise
- graph representation
- graph structure
- graph theory
- path length
- graph matching
- disjoint paths
- dependency graph
- random walk
- graph theoretic
- spanning tree
- weighted graph
- graph properties
- graph mining
- bipartite graph
- directed graph
- structured data
- data sets
- directed acyclic graph
- graph databases
- connected components
- graph partitioning
- social network analysis
- shortest path
- minimum spanning tree
- graph search
- special case
- stable set
- social networks
- information retrieval