An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633)
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 6033273
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach |
scientific article; zbMATH DE number 6033273 |
Statements
An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (English)
0 references
11 May 2012
0 references
connectivity augmentation
0 references
square-free 2-matching
0 references
jump system
0 references
subcubic graph
0 references
0 references
0 references
0 references
0 references
0.8343201875686646
0 references
0.8040287494659424
0 references
0.802407443523407
0 references
