Packings of cuts realizing distances between certain vertices in a planar graph (Q804586)
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: Packings of cuts realizing distances between certain vertices in a planar graph |
scientific article; zbMATH DE number 4202287
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Packings of cuts realizing distances between certain vertices in a planar graph |
scientific article; zbMATH DE number 4202287 |
Statements
Packings of cuts realizing distances between certain vertices in a planar graph (English)
0 references
1990
0 references
The author gives a new proof of a theorem concerning distances and cuts in planar graph by \textit{A. Schrijver} [J. Comb. Theory (to appear)]. The new approach yields a strongly polynomial-time algorithm for finding the cut in question.
0 references
distances
0 references
cuts
0 references
planar graph
0 references
0.8252378702163696
0 references
0.8018622398376465
0 references
0.7710874080657959
0 references
0.7710874080657959
0 references
0.7604575753211975
0 references
