A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs (Q2379975)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs |
scientific article |
Statements
A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs (English)
0 references
24 March 2010
0 references
algorithms
0 references
computational complexity
0 references
combinatorial problem
0 references
minimal cut
0 references
edge ranking
0 references
