Minimal unsatisfiability and minimal strongly connected digraphs

DOI10.1007/978-3-319-94144-8_20OpenAlexW2809862280MaRDI QIDQ1656590

Hoda Abbasizanjani, Oliver Kullmann

Publication date: 10 August 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-94144-8_20

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Directed graphs (digraphs), tournaments (05C20) Computational aspects of satisfiability (68R07)

This page was built for publication: Minimal unsatisfiability and minimal strongly connected digraphs