Minimum path decompositions of oriented cubic graphs.
K. B. ReidKeith WaylandPublished in: J. Graph Theory (1987)
Keyphrases
- minimum cost
- spanning tree
- connected dominating set
- shortest path
- graph theoretic
- database
- graph matching
- graph theory
- graph model
- square error
- data sets
- structured objects
- edge weights
- random graphs
- graph representation
- finding the shortest path
- dominating set
- strongly connected
- np hard
- undirected graph
- graph databases
- pairwise
- b spline