Algorithms for finding a rooted \((k,1)\)-edge-connected orientation (Q2636819)
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: Algorithms for finding a rooted \((k,1)\)-edge-connected orientation |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for finding a rooted \((k,1)\)-edge-connected orientation |
scientific article |
Statements
Algorithms for finding a rooted \((k,1)\)-edge-connected orientation (English)
0 references
18 February 2014
0 references
orientation
0 references
rooted edge-connectivity
0 references
highly \(k\)-tree-connected
0 references
