An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach (Q414633): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C40 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C35 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6033273 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
connectivity augmentation | |||
Property / zbMATH Keywords: connectivity augmentation / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
square-free 2-matching | |||
Property / zbMATH Keywords: square-free 2-matching / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
jump system | |||
Property / zbMATH Keywords: jump system / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
subcubic graph | |||
Property / zbMATH Keywords: subcubic graph / rank | |||
Normal rank |
Revision as of 20:20, 29 June 2023
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