A faster algorithm for computing the principal sequence of partitions of a graph (Q848839)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A faster algorithm for computing the principal sequence of partitions of a graph |
scientific article; zbMATH DE number 5674254
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A faster algorithm for computing the principal sequence of partitions of a graph |
scientific article; zbMATH DE number 5674254 |
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
0.7730534672737122
0 references
0.7730534672737122
0 references
0.7725860476493835
0 references
