Exact Solutions for the Steiner Path Cover Problem on Special Graph Classes.
Frank GurskiStefan HoffmannDominique KomanderCarolin RehsJochen RethmannEgon WankePublished in: OR (2019)
Keyphrases
- graph theory
- random walk
- graph structure
- minimum spanning tree
- stable set
- weighted graph
- solution path
- shortest path
- directed graph
- bipartite graph
- graph partitioning
- path length
- steiner tree
- graph matching
- hamiltonian path
- graph representation
- strongly connected
- random graphs
- equivalence classes
- shortest path problem
- neural network
- bounded degree
- edge weights
- graphical representation
- graph model
- connected components
- class labels
- structured data
- bayesian networks
- image segmentation