Fast edge orientation for unweighted graphs

MaRDI QIDQ4633834zbMATH OpenFDO

Authors Anand Bhalgat, Ramesh Hariharan

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496800

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40)

Recommendations

• Deterministic O(nm) time edge-splitting in undirected graphs
• scientific article; zbMATH DE number 1256720
• A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs
• An algorithm for minimum cost arc-connectivity orientations
• Efficient edge splitting-off algorithms maintaining all-pairs edge-connectivities

Cited in

(2)

• Algorithms for finding a rooted \((k,1)\)-edge-connected orientation
• On 2-strong connectivity orientations of mixed graphs and related problems

This page was built for publication: Fast edge orientation for unweighted graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633834)