Algorithms for finding a rooted \((k,1)\)-edge-connected orientation

DOI10.1016/j.dam.2013.10.004zbMath1283.05150OpenAlexW2035354248MaRDI QIDQ2636819

Csaba Király

Publication date: 18 February 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.10.004

zbMATH Keywords

orientationhighly \(k\)-tree-connectedrooted edge-connectivity

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (1)

Generic global rigidity of body-hinge frameworks

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized polymatroids and submodular flows
• On the orientation of graphs
• A note on the Frank-Tardos bi-truncation algorithm for crossing- submodular functions
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• On the orientation of graphs and hypergraphs
• On the degrees of the vertices of a directed graph
• On the Problem of Decomposing a Graph into n Connected Factors
• Minimum partition of a matroid into independent subsets

This page was built for publication: Algorithms for finding a rooted \((k,1)\)-edge-connected orientation