Abstract.

We recently introduced the notion of twin-width, a novel graph invariant, and showed that first-order model checking can be solved in time \(f(d,k)n\) for \(n\)-vertex graphs given with a witness that the twin-width is at most \(d\), called \(d\)-contraction sequence or \(d\)-sequence, and formulas of size \(k\) [Bonnet et al., JACM ’22]. The inevitable price to pay for such a general result is that \(f\) is a tower of exponentials of height roughly \(k\). In this paper, we show that algorithms based on twin-width need not be impractical. We present \(2^{O(k)}n\)-time algorithms for \(k\)-independent set, \(r\)-scattered set, \(k\)-clique, and \(k\)-dominating set when an \(O(1)\)-sequence of the graph is given in input. We further show how to solve the weighted version of \(k\)-independent set, subgraph isomorphism, and induced subgraph isomorphism in the slightly worse running time \(2^{O(k \log k)}n\). Up to logarithmic factors in the exponent, all these running times are optimal unless the exponential time hypothesis fails. Like our first-order model checking algorithm, these new algorithms are based on a dynamic programming scheme following the sequence of contractions forward. We then show a second algorithmic use of the contraction sequence by starting at its end and rewinding it. As an example of such a reverse scheme, we present a polynomial-time algorithm that properly colors the vertices of a graph with relatively few colors, thereby establishing that bounded twin-width classes are \(\chi\)-bounded. This significantly extends the \(\chi\)-boundedness of bounded rank-width classes and does so with a very concise proof. It readily yields a constant approximation for max independent set on \(K_t\)-free graphs of bounded twin-width and a \(2^{O(\text{OPT})}\)-approximation for min coloring on bounded twin-width graphs. We further observe that a constant approximation for max independent set on bounded twin-width graphs (but arbitrarily large clique number) would actually imply a polynomial-time approximation scheme. The third algorithmic use of twin-width builds on the second one. Playing the contraction sequence backward, we show that bounded twin-width graphs can be edge-partitioned into a linear number of bicliques such that both sides of the bicliques are on consecutive vertices in a fixed vertex ordering. This property is trivially shared with graphs of bounded average degree. Given that biclique edge-partition, we show how to solve the unweighted single-source shortest paths, and hence all-pairs shortest paths, in time \(O(n \log n)\) and time \(O(n^2 \log n)\), respectively. In sharp contrast, even diameter does not admit a truly subquadratic algorithm on bounded twin-width graphs unless the strong exponential time hypothesis fails. The fourth algorithmic use of twin-width builds on the so-called versatile tree of contractions [Bonnet et al., Comb. Theory ’22], a branching and more robust witness of low twin-width. We present constant-approximation algorithms for min dominating set and related problems on bounded twin-width graphs by showing that the integrality gap is constant. This is done by going down the versatile tree and stopping according to a problem-dependent criterion. At the reached node, a greedy approach yields the desired approximation.

Keywords

  1. twin-width
  2. max independent set
  3. min dominating set
  4. coloring
  5. parameterized algorithms
  6. approximation algorithms

MSC codes

  1. 05C85

Get full access to this article

View all available purchase options and get full access to this article.

References

1.
N. Alon, J. Pach, R. Pinchasi, R. Radoičić, and M. Sharir, Crossing patterns of semi-algebraic sets, J. Combin. Theory Ser. A, 111 (2005), pp. 310–326.
2.
B. S. Baker, Approximation algorithms for NP-complete problems on planar graphs, J. ACM, 41 (1994), pp. 153–180.
3.
P. Bergé, É. Bonnet, H. Déprés, and R. Watrigant, Approximating highly inapproximable problems on graphs of bounded twin-width, in STACS 2023, P. Berenbrink, P. Bouyer, A. Dawar, and M. M. Kanté, eds., Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2023, 10.
4.
H. L. Bodlaender, R. G. Downey, M. R. Fellows, and D. Hermelin, On problems without polynomial kernels, J. Comput. Syst. Sci., 75 (2009), pp. 423–434.
5.
M. Bonamy and M. Pilipczuk, Graphs of bounded cliquewidth are polynomially \(\chi\)-bounded, Adv. Comb., (2020), https://doi.org/10.19086/aic.13668.
6.
É. Bonnet, C. Geniet, E. J. Kim, S. Thomassé, and R. Watrigant, Twin-width II: Small classes, Comb. Theory, 2 (2022), https://doi.org/10.5070/C62257876.
7.
É. Bonnet, E. J. Kim, A. Reinald, S. Thomassé, and R. Watrigant, Twin-width and polynomial kernels, Algorithmica, 84 (2022), pp. 3300–3337.
8.
É. Bonnet, E. J. Kim, S. Thomassé, and R. Watrigant, Twin-width I: Tractable FO model checking, J. ACM, 69 (2022), pp. 1–46.
9.
N. Bousquet, W. C. van Batenburg, L. Esperet, G. Joret, W. Lochet, C. Muller, and F. Pirot, Packing and covering balls in graphs excluding a minor, Combinatorica, 41 (2021), pp. 299–318.
10.
B. Chazelle, Filtering search: A new approach to query-answering, SIAM J. Comput., 15 (1986), pp. 703–724.
11.
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 3rd ed., MIT Press, Cambridge, MA, 2009.
12.
D. Coudert, G. Ducoffe, and A. Popa, Fully polynomial FPT algorithms for some classes of bounded clique-width graphs, ACM Trans. Algorithms, 15 (2019), pp. 33:1–33:57.
13.
B. Courcelle, The monadic second-order logic of graphs. I. Recognizable sets of finite graphs, Inform. and Comput., 85 (1990), pp. 12–75.
14.
B. Courcelle, J. A. Makowsky, and U. Rotics, Linear time solvable optimization problems on graphs of bounded clique-width, Theory Comput. Syst., 33 (2000), pp. 125–150.
15.
E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikos, Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs, J. ACM, 52 (2005), pp. 866–893.
16.
G. Ding, P. D. Seymour, and P. Winkler, Bounding the vertex cover number of a hypergraph, Combinatorica, 14 (1994), pp. 23–34.
17.
I. Dinur and D. Steurer, Analytical approach to parallel repetition, in STOC ’14: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, 2014, pp. 624–633, https://doi.org/10.1145/2591796.2591884.
18.
F. Dorn, Planar subgraph isomorphism revisited, in 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010), Nancy, France, 2010, pp. 263–274.
19.
Z. Dvořák and D. Král’, Classes of graphs with small rank decompositions are \(\chi\)-bounded, European J. Combin., 33 (2012), pp. 679–683.
20.
Z. Dvořák, Constant-factor approximation of the domination number in sparse graphs, European J. Combin., 34 (2013), pp. 833–840.
21.
D. Eppstein, Subgraph isomorphism in planar graphs and related problems, J. Graph Algorithms Appl., 3 (1999), pp. 1–27.
22.
D. Eppstein, Diameter and treewidth in minor-closed graph families, Algorithmica, 27 (2000), pp. 275–291.
23.
J. Evald and S. Dahlgaard, Tight Hardness Results for Distance and Centrality Problems in Constant Degree Graphs, preprint, https://arxiv.org/abs/1609.08403, 2016.
24.
U. Feige, S. Goldwasser, L. Lovász, S. Safra, and M. Szegedy, Approximating clique is almost NP-complete (preliminary version), in Proceedings 32nd Annual Symposium of Foundations of Computer Science 1991, San Juan, PR, IEEE, 1991, pp. 2–12.
25.
J. Flum and M. Grohe, Fixed-parameter tractability, definability, and model-checking, SIAM J. Comput., 31 (2001), pp. 113–145.
26.
L. Fortnow and R. Santhanam, Infeasibility of instance compression and succinct PCPs for NP, J. Comput. Syst. Sci., 77 (2011), pp. 91–106.
27.
M. Frick and M. Grohe, The complexity of first-order and monadic second-order logic revisited, Ann. Pure Appl. Log., 130 (2004), pp. 3–31.
28.
H. N. Gabow and R. E. Tarjan, A linear-time algorithm for a special case of disjoint set union, J. Comput. Syst. Sci., 30 (1985), pp. 209–221.
29.
M. Grötschel, L. Lovász, and A. Schrijver, The ellipsoid method and its consequences in combinatorial optimization, Combinatorica, 1 (1981), pp. 169–197.
30.
A. Grzesik, T. Klimosova, M. Pilipczuk, and M. Pilipczuk, Polynomial-time algorithm for maximum weight independent set on \({P}_6\)-free graphs, in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms 2019, SIAM, Philadelphia, 2019, pp. 1257–1271, https://doi.org/10.1137/1.9781611975482.77.
31.
S. Guillemot and D. Marx, Finding small patterns in permutations in linear time, in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms 2014, SIAM, Philadelphia, 2014, pp. 82–101, https://doi.org/10.1137/1.9781611973402.7.
32.
D. Haussler and E. Welzl, Epsilon-nets and simplex range queries, Discrete Comput. Geom., 2 (1987), pp. 127–151.
33.
R. Impagliazzo and R. Paturi, On the complexity of k-SAT, J. Comput. Syst. Sci., 62 (2001), pp. 367–375.
34.
R. Impagliazzo, R. Paturi, and F. Zane, Which problems have strongly exponential complexity?, J. Comput. Syst. Sci., 63 (2001), pp. 512–530.
35.
D. S. Johnson, Approximation algorithms for combinatorial problems, J. Comput. Syst. Sci., 9 (1974), pp. 256–278.
36.
S. Kratsch and F. Nelles, Efficient parameterized algorithms for computing all-pairs shortest paths, in 37th International Symposium on Theoretical Aspects of Computer Science (STACS 2020), Leibniz-Zentrum für Informatik, Dagstuhl, Germany, 2020, pp. 38:1–38:15, https://doi.org/10.4230/LIPIcs.STACS.2020.38.
37.
L. Lovász, On the ratio of optimal integral and fractional covers, Discrete Math., 13 (1975), pp. 383–390.
38.
M. Pilipczuk and S. Siebertz, Polynomial bounds for centered colorings on proper minor-closed graph classes, in Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms 2019, SIAM, Philadelphia, 2019, pp. 1501–1520, https://doi.org/10.1137/1.9781611975482.91.
39.
S. Poljak, A note on stable sets and colorings of graphs, Comment. Math. Univ. Carolin., 15 (1974), pp. 307–309.
40.
J. M. Schmidt, Interval stabbing problems in small integer ranges, in Algorithms and Computation, 20th International Symposium (ISAAC 2009), Lecture Notes in Comput. Sci. 5878, Springer, Cham, 2009, pp. 163–172.
41.
C. Sloper and J. A. Telle, An overview of techniques for designing parameterized algorithms, Comput. J., 51 (2008), pp. 122–136.
42.
H. Tamaki, Positive-instance driven dynamic programming for treewidth, J. Comb. Optim., 37 (2019), pp. 1283–1311.
43.
R. Yuster, Efficient algorithms on sets of permutations, dominance, and real-weighted APSP, in SODA ’09: Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms, SIAM, Philadelphia, 2009, pp. 950–957.

Information & Authors

Information

Published In

cover image SIAM Journal on Computing
SIAM Journal on Computing
Pages: 1602 - 1640
ISSN (online): 1095-7111

History

Submitted: 24 May 2021
Accepted: 10 July 2024
Published online: 16 October 2024

Keywords

  1. twin-width
  2. max independent set
  3. min dominating set
  4. coloring
  5. parameterized algorithms
  6. approximation algorithms

MSC codes

  1. 05C85

Authors

Affiliations

Université Lyon, CNRS, ENS de Lyon, Université Claude Bernard Lyon 1, LIP UMR5668, Lyon 69634 France.
Colin Geniet
University of Warsaw, Warsaw 00-927 Poland.
School of Computing, KAIST, Daejeon, Korea.
Stéphan Thomassé
Université Lyon, CNRS, ENS de Lyon, Université Claude Bernard Lyon 1, LIP UMR5668, Lyon 69634 France.
Rémi Watrigant
Université Lyon, CNRS, ENS de Lyon, Université Claude Bernard Lyon 1, LIP UMR5668, Lyon 69634 France.

Funding Information

ANR: ANR-21-CE48-0014, ANR-19-CE48-0013
Funding: This work was supported by the ANR projects TWIN-WIDTH (ANR-21-CE48-0014) and Digraphs (ANR-19-CE48-0013).

Metrics & Citations

Metrics

Citations

If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.

Cited By

There are no citations for this item

View Options

View options

PDF

View PDF

Full Text

View Full Text

Media

Figures

Other

Tables

Share

Share

Copy the content Link

Share with email

Email a colleague

Share on social media