scientific article; zbMATH DE number 5764893

MaRDI QIDQ3579486zbMATH OpenFDO

Authors Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi

Publication date 6 August 2010

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05) Connectivity (05C40)

Cited in

(8)

• A new contraction technique with applications to congruency-constrained cuts
• A linear-time algorithm to find a pair of arc-disjoint spanning in-arborescence and out-arborescence in a directed acyclic graph
• Low recourse arborescence forests under uniformly random arcs
• Splitting-off in hypergraphs
• Hypergraph connectivity augmentation in strongly polynomial time
• Splitting-off in hypergraphs
• Fast algorithms via dynamic-oracle matroids
• Deterministic minimum cut in poly-logarithmic maximum flows

This page was built for publication:

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