A faster algorithm for computing the principal sequence of partitions of a graph (Q848839)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A faster algorithm for computing the principal sequence of partitions of a graph |
scientific article |
Statements
A faster algorithm for computing the principal sequence of partitions of a graph (English)
0 references
23 February 2010
0 references
principal sequence of partitions
0 references
network attack
0 references
network strength
0 references
minimum cut/maximum flow
0 references
parametric algorithm
0 references
0 references
0 references
0 references
