Packing a tree with a graph of the same size.
P. J. SlaterS. K. TeoH. P. YapPublished in: J. Graph Theory (1985)
Keyphrases
- maximal cliques
- graph structure
- spanning tree
- tree shaped
- tree structure
- bounded degree
- graph theory
- hierarchical data structure
- minimum spanning tree
- root node
- bounded treewidth
- random walk
- graph representation
- packing problem
- bipartite graph
- graph theoretic
- maximum weight
- network size
- graph partitioning
- equivalence class
- similarity measure
- graph databases
- graph model
- graph mining
- directed acyclic graph
- connected components
- hierarchical structure
- computational complexity