Finding Lean Induced Cycles in Binary Hypercubes

DOI10.1007/978-3-642-02777-2_4zbMath1247.68248OpenAlexW1586837671MaRDI QIDQ3637155

Thomas Wahl, Leopold Haller, Yury Chebiryak, Daniel Kroening

Publication date: 7 July 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02777-2_4

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Uses Software

• MiniSat

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• SAT-solving the coverability problem for Petri nets
• A heuristic approach for constructing symmetric Gray codes
• Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
• A Survey of Combinatorial Gray Codes
• Periodic Orbits and Equilibria in Glass Models for Gene Regulatory Networks
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• An Algebraic Algorithm for the Identification of Glass Networks with Periodic Orbits Along Cyclic Attractors
• Generalized Snake-in-the-Box Codes
• Theory and Applications of Satisfiability Testing
• Theory and Applications of Satisfiability Testing
• Generation of Oriented Matroids Using Satisfiability Solvers

This page was built for publication: Finding Lean Induced Cycles in Binary Hypercubes