A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs (Q2379975)
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 polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs |
scientific article; zbMATH DE number 5686416
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A polynomial time algorithm for obtaining minimum edge ranking on two-connected outerplanar graphs |
scientific article; zbMATH DE number 5686416 |
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
0.8512600660324097
0 references
0.8294838666915894
0 references
0.8275361061096191
0 references
