Maximum Matching and Linear Programming in Fixed-Point Logic with Counting

DOI10.1109/LICS.2013.23zbMath1433.03069arXiv1304.6870OpenAlexW2025948098WikidataQ58215487 ScholiaQ58215487MaRDI QIDQ5271054

No author found.

Publication date: 3 July 2017

Published in: 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1304.6870

zbMATH Keywords

fixed-point logic with counting, linear programming, maximum matching, maximum flow, minimum cut, minimum odd cut

Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Logic in computer science (03B70) Second- and higher-order model theory (03C85) Flows in graphs (05C21)

Related Items (3)

On symmetric circuits and fixed-point logics ⋮ Symbioses between mathematical logic and computer science ⋮ Choiceless Polynomial Time on Structures with Small Abelian Colour Classes

This page was built for publication: Maximum Matching and Linear Programming in Fixed-Point Logic with Counting