Faster algorithms for half-integral T -Path packing

DOI10.4230/LIPICS.ISAAC.2017.8zbMath1457.68200OpenAlexW2782967788MaRDI QIDQ5136223

Stepan Artamonov, Maxim A. Babenko

Publication date: 25 November 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.ISAAC.2017.8

zbMATH Keywords

matchingsgraph algorithmsmultiflowspath packings

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

The Lovász-Cherkassky theorem in countable graphs

Cites Work

• Matching theory
• Über die Maximalzahl kantendisjunkter A-Wege
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Maximum skew-symmetric flows and matchings
• Clique partitions, graph compression and speeding-up algorithms
• Min-cost multiflows in node-capacitated undirected networks
• TRIANGLE-FREE 2-MATCHINGS REVISITED
• Some new results on node-capacitated packing of A-paths

This page was built for publication: Faster algorithms for half-integral T -Path packing