Graph connectivity and its augmentation: Applications of MA orderings (Q697579): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 10:50, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Graph connectivity and its augmentation: Applications of MA orderings |
scientific article |
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
