Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators.
Guyslain NavesF. Bruce ShepherdHenry XiaPublished in: Math. Program. (2023)
Keyphrases
- maximum weight
- planar graphs
- minimum weight
- bipartite graph
- graph mining
- weighted graph
- disjoint paths
- independent set
- spanning tree
- graph isomorphism
- graph databases
- graph patterns
- undirected graph
- subgraph mining
- structured data
- minimum spanning tree
- partial order
- pattern mining
- tree structure
- greedy heuristic
- frequent subgraphs
- directed graph
- minimum cost
- approximation algorithms
- multi dimensional
- data objects
- subgraph isomorphism
- graph data
- b tree
- upper bound
- np hard