Maximum bipartite subgraph of geometric intersection graphs
From MaRDI portal
Publication:782177
DOI10.1007/978-3-030-39881-1_14MaRDI QIDQ782177
Anil Maheshwari, Sasanka Roy, Satyabrata Jana, Saeed Mehrabi
Publication date: 22 July 2020
Full work available at URL: https://arxiv.org/abs/1909.03896
approximation schemes; geometric intersection graphs; \texttt{NP}-hardness; bipartite subgraph; triangle-free subgraph
68Wxx: Algorithms in computer science