Polar SAT and related graphs

DOI10.1016/j.jda.2005.01.004zbMath1135.68445OpenAlexW2008831805MaRDI QIDQ2466002

Olga I. Zverovich, Igor Edm. Zverovich

Publication date: 11 January 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2005.01.004

zbMATH Keywords

satisfiability problemsatgraphpolar SAT

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Domination, independent domination, and duality in strongly chordal graphs
• Weakly triangulated graphs
• Satgraphs and independent domination. I
• A linear-time algorithm for testing the truth of certain quantified Boolean formulas
• Domination in permutation graphs

This page was built for publication: Polar SAT and related graphs