An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jctb.2011.08.007 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2148517677 / rank | |||
Normal rank | |||
Revision as of 02:54, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach |
scientific article |
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
