On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)

DOI10.1137/1.9781611975482.53zbMath1434.05032arXiv1807.05164OpenAlexW2884406315MaRDI QIDQ5236236

Rohit Gurjar, Nisheeth K. Vishnoi

Publication date: 15 October 2019

Published in: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

randomized algorithmweighted undirected graphsglobal min-cuts

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial aspects of matroids and geometric lattices (05B35) Randomized algorithms (68W20)

Related Items (2)

On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes) ⋮ Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces

This page was built for publication: On the Number of Circuits in Regular Matroids (with Connections to Lattices and Codes)