In this section we show that the problem SATR can be solved in linear-time for AT-graphs A with \(\mathrm {\lambda }(A) \le ~3\); see Theorem 2. We first give a short high-level overview of the overall strategy but note that proper definitions will only be given later in the detailed description of the algorithm.
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Get in touch with Roma
Contact Roma, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack