Minimum multicuts and Steiner forests for Okamura-Seymour graphs
Arindam PalPublished in: CoRR (2011)
Keyphrases
- spanning tree
- connected dominating set
- graph theoretic
- graph databases
- dominating set
- random forest
- graph representation
- random graphs
- minimum spanning tree
- undirected graph
- real time
- weighted graph
- bipartite graph
- semi supervised
- graph structures
- series parallel
- information retrieval
- square error
- dynamic graph
- data sets