Approximation metatheorem for fractionally treewidth-fragile graphs.
Zdenek DvorákPublished in: CoRR (2021)
Keyphrases
- bounded treewidth
- discrete random variables
- graph structure
- upper bound
- graph theoretic
- graph matching
- constraint graph
- error bounds
- approximation algorithms
- search space
- weighted graph
- graph theory
- decision problems
- closed form
- np complete
- graph model
- graph databases
- graph partitioning
- graph representation
- approximation error
- pairwise
- error tolerance
- subgraph isomorphism
- adjacency matrix
- graph structures
- graph construction
- approximation methods
- undirected graph
- spanning tree
- graph mining
- greedy algorithm
- boolean functions