Centroids, Representations, and Submodular Flows
From MaRDI portal
Publication:4837547
DOI10.1006/jagm.1995.1022zbMath0826.68095OpenAlexW2056886763MaRDI QIDQ4837547
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
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)
Related Items (10)
Increasing digraph arc-connectivity by arc addition, reversal and complement ⋮ An algorithm for minimum cost arc-connectivity orientations ⋮ Tree-representation of set families and applications to combinatorial decompositions ⋮ Fractional packing in ideal clutters ⋮ Enumerating \(k\)-arc-connected orientations ⋮ Anti-forcing spectra of perfect matchings of graphs ⋮ The edge-orientation problem and some of its variants on weighted graphs ⋮ A Representation Theorem for Union-Difference Families and Application ⋮ Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs ⋮ Forcing matchings on square grids
This page was built for publication: Centroids, Representations, and Submodular Flows
