Maximum bipartite subgraph of geometric intersection graphs
From MaRDI portal
Publication:782177
DOI10.1007/978-3-030-39881-1_14OpenAlexW3004088662MaRDI QIDQ782177
Saeed Mehrabi, Satyabrata Jana, Sasanka Roy, Anil Maheshwari
Publication date: 22 July 2020
Full work available at URL: https://arxiv.org/abs/1909.03896
approximation schemesgeometric intersection graphs\texttt{NP}-hardnessbipartite subgraphtriangle-free subgraph
Related Items (2)
Graph Bipartization Problem with Applications to Via Minimization in VLSI Design ⋮ Two generalizations of proper coloring: hardness and approximability
This page was built for publication: Maximum bipartite subgraph of geometric intersection graphs
