Berge's theorem for the maximum charge problem

DOI10.1016/j.disopt.2005.08.008zbMath1100.05075OpenAlexW2015967296MaRDI QIDQ2506824

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

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)

Related Items (1)

A primal-dual approximation algorithm for \textsc{minsat}

Cites Work

• Matching theory
• König-Egerváry graphs, 2-bicritical graphs and fractional matchings
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Minimum node covers and 2-bicritical graphs
• TWO THEOREMS IN GRAPH THEORY
• Vertex packings: Structural properties and algorithms
• Unnamed Item

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