Computing the largest bond and the maximum connected cut of a graph (Q2663713)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing the largest bond and the maximum connected cut of a graph |
scientific article |
Statements
Computing the largest bond and the maximum connected cut of a graph (English)
0 references
19 April 2021
0 references
bond
0 references
cut
0 references
maximum cut
0 references
connected cut
0 references
FPT
0 references
treewidth
0 references
clique-width
0 references
0 references
0 references
0 references
0 references
