Balanced connected subgraph problem in geometric intersection graphs (Q2180133)
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 7200286
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Balanced connected subgraph problem in geometric intersection graphs |
scientific article; zbMATH DE number 7200286 |
Statements
Balanced connected subgraph problem in geometric intersection graphs (English)
0 references
13 May 2020
0 references
balanced connected subgraph
0 references
interval graphs
0 references
permutation graphs
0 references
circular-arc graphs
0 references
unit-disk graphs
0 references
outer-string graphs
0 references
NP-hardness
0 references
color-balanced
0 references
fixed-parameter tractability
0 references
0.8797138333320618
0 references
0.8763514161109924
0 references
