Berge's theorem for the maximum charge problem

DOI10.1016/J.DISOPT.2005.08.008MaRDI QIDQ2506824zbMATH OpenOpenAlexFDO

Authors Ramesh Krishnamurti, Daya Ram Gaur, Subir Kumar Ghosh, Horst Sachs

Publication date 10 October 2006

Published in Discrete Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disopt.2005.08.008

zbMATH Keywords

augmenting pathfractional matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Augmenting trail theorem for the maximum 1-2 matching problem
• scientific article; zbMATH DE number 795216
• An augmenting path algorithm for linear matroid parity
• Matchings of cycles and paths in directed graphs
• A theory of alternating paths and blossoms for proving correctness of the \(O(\sqrt{V}E)\) general graph maximum matching algorithm

Cites work

• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• scientific article; zbMATH DE number 1131873 (Why is no real title available?)
• König-Egerváry graphs, 2-bicritical graphs and fractional matchings
• Matching theory
• Minimum node covers and 2-bicritical graphs
• TWO THEOREMS IN GRAPH THEORY
• Vertex packings: Structural properties and algorithms

Cited in

(2)

• A primal-dual approximation algorithm for \textsc{minsat}
• Luzin’s theorem for charges

This page was built for publication: Berge's theorem for the maximum charge problem

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