Homology as a Tool in Integer Programming

DOI10.1137/0606063zbMATH Open0587.90076OpenAlexW2052438194MaRDI QIDQ3714903FDOQ3714903

Authors: Saul Stahl 

Publication date: 1985

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0606063

Recommendations

• Complexes of graph homomorphisms
• Homology tests for graph colorings
• Rational homotopy theory for computing colorability of simplicial complexes
• Integer programming models for colorings of mixed hypergraphs

zbMATH Keywords

homology theorybounds on the solutionsgraph coloring techniques

Mathematics Subject Classification ID

Integer programming (90C10) Coloring of graphs and hypergraphs (05C15) Fixed points and coincidences in algebraic topology (55M20)

Cites Work

• Kneser's conjecture, chromatic number, and homotopy
• n-tuple colorings and associated graphs
• Reductions of n-Fold Covers
• From graphs to ortholattices and equivariant maps

Cited In (3)

• Extending the Notion of AT-Model for Integer Homology Computation
• Quantum walks: Schur functions meet symmetry protected topological phases
• Homotopy techniques in linear programming

This page was built for publication: Homology as a Tool in Integer Programming

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