Bipartizing (Pseudo-)Disk Graphs: Approximation with a Ratio Better than 3.
Daniel LokshtanovFahad PanolanSaket SaurabhJie XueMeirav ZehaviPublished in: CoRR (2024)
Keyphrases
- disk resident
- graph matching
- graph theoretic
- graph theory
- graph mining
- series parallel
- graph databases
- social networks
- subgraph isomorphism
- approximation methods
- approximation error
- standard deviation
- error bounds
- main memory
- neural network
- approximation algorithms
- graph structure
- random access
- directed graph
- multi dimensional
- adjacency matrix
- approximation ratio
- lower bound
- image segmentation