Algorithms for (0, 1,<i>d</i>)-graphs with<i>d</i>constrains (Q5747711)
From MaRDI portal
scientific article; zbMATH DE number 5785397
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for (0, 1,<i>d</i>)-graphs with<i>d</i>constrains |
scientific article; zbMATH DE number 5785397 |
Statements
Algorithms for (0, 1,<i>d</i>)-graphs with<i>d</i>constrains (English)
0 references
14 September 2010
0 references
matching
0 references
extendability
0 references
augmentation
0 references
strong connectivity
0 references
algorithms
0 references
