Algorithms for (0, 1,<i>d</i>)-graphs with<i>d</i>constrains (Q5747711)
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 5785397
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.90422374
0 references
0.89064825
0 references
0.88980305
0 references
0.8882047
0 references
0.8860835
0 references
0.8832254
0 references
0.88232243
0 references
0.8816991
0 references
0.8811027
0 references
