3
$\begingroup$

SAT formulas for connectedness of a set of nodes in a graph can be constructed, basically by specifying the distance of each node to a source node, see for example the answers here:

Boolean constraints for a connected component of a graph and SAT algorithm for determining if a graph is disjoint

My question: is there a reference of the use of this approach in the literature?

asked Dec 9, 2024 at 8:44
$\endgroup$

0

Know someone who can answer? Share a link to this question via email, Twitter, or Facebook.

Your Answer

Draft saved
Draft discarded

Sign up or log in

Sign up using Google
Sign up using Email and Password

Post as a guest

Required, but never shown

Post as a guest

Required, but never shown

By clicking "Post Your Answer", you agree to our terms of service and acknowledge you have read our privacy policy.

Start asking to get answers

Find the answer to your question by asking.

Ask question

Explore related questions

See similar questions with these tags.