Algorithms and hardness results for the maximum balanced connected subgraph problem (Q2180163): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Changed an Item |
||
| Property / arXiv ID | |||
| Property / arXiv ID: 1910.07305 / rank | |||
Normal rank | |||
Latest revision as of 01:43, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms and hardness results for the maximum balanced connected subgraph problem |
scientific article |
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
