The balanced connected subgraph problem: complexity results in bounded-degree and bounded-diameter graphs (Q2180175)
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 7200317
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The balanced connected subgraph problem: complexity results in bounded-degree and bounded-diameter graphs |
scientific article; zbMATH DE number 7200317 |
Statements
The balanced connected subgraph problem: complexity results in bounded-degree and bounded-diameter graphs (English)
0 references
13 May 2020
0 references
complexity
0 references
bounded diameter
0 references
bounded degree
0 references
0.9268843531608582
0 references
0.8804501891136169
0 references
0.8491126298904419
0 references
