The balanced connected subgraph problem for geometric intersection graphs (Q2166729)
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 7575080
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The balanced connected subgraph problem for geometric intersection graphs |
scientific article; zbMATH DE number 7575080 |
Statements
The balanced connected subgraph problem for geometric intersection graphs (English)
0 references
25 August 2022
0 references
balanced connected subgraph
0 references
circular-arc graphs
0 references
color-balanced
0 references
interval graphs
0 references
NP-hard
0 references
outer-string graphs
0 references
permutation graphs
0 references
unit-disk graphs
0 references
0 references
0.991416037082672
0 references
0.8750277161598206
0 references
0.8730201125144958
0 references
