On the hardness of the Balanced Connected Subgraph Problem for families of Regular Graphs (Q6068941)
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: On the hardness of the Balanced Connected Subgraph Problem for families of Regular Graphs |
scientific article; zbMATH DE number 7779300
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the hardness of the Balanced Connected Subgraph Problem for families of Regular Graphs |
scientific article; zbMATH DE number 7779300 |
Statements
On the hardness of the Balanced Connected Subgraph Problem for families of Regular Graphs (English)
0 references
15 December 2023
0 references
maximum cardinality induced connected subgraph
0 references
time complexity of the BCS problem
0 references
