Survivable Network Design for Group Connectivity in Low-Treewidth Graphs.
Parinya ChalermsookSyamantak DasGuy EvenBundit LaekhanukitDaniel VazPublished in: APPROX-RANDOM (2018)
Keyphrases
- bounded treewidth
- upper bound
- constraint graph
- graph representation
- boolean functions
- graph structure
- graph theory
- group members
- np complete
- lower bound
- graph theoretic
- graph partitioning
- graph matching
- directed graph
- search space
- bipartite graph
- constraint propagation
- graph model
- connected components
- data model
- pairwise
- search algorithm