How to make a digraph strongly connected

DOI10.1007/BF02579270MaRDI QIDQ1165251zbMATH OpenFDO

Authors András Frank

Publication date 1981

Published in Combinatorica (Search for Journal in Brave)

zbMATH Keywords

strongly connected digraphminimum weight covering

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Integer programming (90C10) Connectivity (05C40)

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• A Minimax Theorem for Directed Graphs
• ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
• An Algorithm for Submodular Functions on Graphs
• On two minimax theorems in graph

Cited in

(13)

• An application of submodular flows
• The ellipsoid method and its consequences in combinatorial optimization
• Robust independence systems
• An algorithm for minimum cost arc-connectivity orientations
• A Push/Relabel framework for submodular flows and its definement for 0-1 submodular flows
• Finding feasible vectors of Edmonds-Giles polyhedra
• Fractional packing in ideal clutters
• Generalized polymatroids and submodular flows
• Polyhedral proof methods in combinatorial optimization
• Approximations for the maximum acyclic subgraph problem
• An efficient scaling algorithm for the minimum weight bibranching problem
• Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
• Supermodularity in unweighted graph optimization. I: Branchings and matchings

This page was built for publication: How to make a digraph strongly connected

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