Minimum Cuts and Shortest Cycles in Directed Planar Graphs via Noncrossing Shortest Paths (Q2968519): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 21:19, 3 February 2024
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
