Algorithms for finding a maximum non-\(k\)-linked graph (Q2910937)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6081283
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for finding a maximum non-\(k\)-linked graph |
scientific article; zbMATH DE number 6081283 |
Statements
12 September 2012
0 references
maximum induced subgraph
0 references
vertex-connectivity
0 references
\(k\)-linkedness
0 references
Algorithms for finding a maximum non-\(k\)-linked graph (English)
0 references
0.9973310828208924
0 references
0.8024868965148926
0 references
0.8024868965148926
0 references
0.7735114693641663
0 references
