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 this page instead for the normal view: The balanced connected subgraph problem: complexity results in bounded-degree and bounded-diameter graphs |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The balanced connected subgraph problem: complexity results in bounded-degree and bounded-diameter graphs |
scientific article |
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
