Algorithms and hardness results for the maximum balanced connected subgraph problem (Q2180163)
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 7200305
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms and hardness results for the maximum balanced connected subgraph problem |
scientific article; zbMATH DE number 7200305 |
Statements
Algorithms and hardness results for the maximum balanced connected subgraph problem (English)
0 references
13 May 2020
0 references
balanced connected subgraph
0 references
exact exponential-time algorithm
0 references
interval graph
0 references
tree
0 references
treewidth
0 references
0.9197178483009338
0 references
0.8804501891136169
0 references
0.8797138333320618
0 references
