Centroids, Representations, and Submodular Flows

DOI10.1006/JAGM.1995.1022zbMATH Open0826.68095OpenAlexW2056886763MaRDI QIDQ4837547FDOQ4837547

Authors: Harold N. Gabow 

Publication date: 3 July 1995

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1995.1022

Recommendations

• scientific article; zbMATH DE number 437545
• Representative families for matroid intersections, with applications to location, packing, and covering problems
• Unifying the representation of symmetric crossing families and weakly partitive families
• scientific article; zbMATH DE number 5535209
• Coverings and structure of crossing families

zbMATH Keywords

flow algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Cited In (11)

• Enumerating \(k\)-arc-connected orientations
• Title not available (Why is that?)
• Tree-representation of set families and applications to combinatorial decompositions
• A Representation Theorem for Union-Difference Families and Application
• Increasing digraph arc-connectivity by arc addition, reversal and complement
• An algorithm for minimum cost arc-connectivity orientations
• Forcing matchings on square grids
• Fractional packing in ideal clutters
• The edge-orientation problem and some of its variants on weighted graphs
• Maximum weighted induced bipartite subgraphs and acyclic subgraphs of planar cubic graphs
• Anti-forcing spectra of perfect matchings of graphs

This page was built for publication: Centroids, Representations, and Submodular Flows

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