Equivalence of strongly connected graphs and black-and-white 2-SAT problems

DOI10.18514/MMN.2018.2140zbMath1424.94109OpenAlexW2921616933WikidataQ128274550 ScholiaQ128274550MaRDI QIDQ5379589

Csaba Biró, Gábor Kusper

Publication date: 12 June 2019

Published in: Miskolc Mathematical Notes (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.18514/mmn.2018.2140

zbMATH Keywords

communication graphstrongly connected graphconnectivity testSAT representationblack-and-white SAT problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Logic in computer science (03B70) Classical propositional logic (03B05) Applications of graph theory to circuits and networks (94C15)

This page was built for publication: Equivalence of strongly connected graphs and black-and-white 2-SAT problems