Algorithms for Finding a Maximum Non-k-linked Graph (Q3092223)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for Finding a Maximum Non-k-linked Graph |
scientific article |
Statements
Algorithms for Finding a Maximum Non-k-linked Graph (English)
0 references
16 September 2011
0 references
\(k\)-linkedness
0 references
\(H\)-linkedness
0 references
disjoint paths
0 references
connectivity
0 references
