Graph connectivity and its augmentation: Applications of MA orderings (Q697579)
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 1801740
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Graph connectivity and its augmentation: Applications of MA orderings |
scientific article; zbMATH DE number 1801740 |
Statements
Graph connectivity and its augmentation: Applications of MA orderings (English)
0 references
17 September 2002
0 references
graphs
0 references
MA ordering
0 references
minimum cuts
0 references
edge-connectivity
0 references
graph augmentation
0 references
polynomial time algorithms
0 references
0 references
0 references
0 references
0 references
0.8248254060745239
0 references
0.773259162902832
0 references
0.773259162902832
0 references
0.7709147334098816
0 references
