Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519)
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: Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths |
scientific article |
Statements
Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (English)
0 references
16 March 2017
0 references
planar graph
0 references
minimum cut
0 references
shortest cycle
0 references
girth
0 references
0 references
0 references
0 references
