Maximum bipartite subgraphs of geometric intersection graphs (Q6552516)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7862297
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum bipartite subgraphs of geometric intersection graphs |
scientific article; zbMATH DE number 7862297 |
Statements
Maximum bipartite subgraphs of geometric intersection graphs (English)
0 references
10 June 2024
0 references
bipartite subgraph
0 references
geometric intersection graphs
0 references
\(NP\)-hardness
0 references
approximation schemes
0 references
triangle-free subgraph
0 references
0 references
0 references
0 references
0 references
0 references
0.9863885641098022
0 references
0.7718505263328552
0 references
0.7684500813484192
0 references
0.767639696598053
0 references
0.7531012296676636
0 references
