Document Open Access Logo

A Practical Algorithm for 2-Admissibility

Authors Christine Awofeso , Patrick Greaves , Oded Lachish , Felix Reidl

PDF

File

Thumbnail PDF
PDF
LIPIcs.SEA.2025.3.pdf
  • Filesize: 6.11 MB
  • 19 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Graph algorithms analysis
Keywords
  • Sparse graphs
  • admissibility

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

The 2-admissibility of a graph is a promising measure to identify real-world networks which have an algorithmically favourable structure. In contrast to other related measures, like the weak/strong 2-colouring numbers or the maximum density of graphs that appear as 1-subdivisions, the 2-admissibility can be computed in polynomial time. However, so far these results are theoretical only and no practical implementation to compute the 2-admissibility exists.
Here we present an algorithm which decides whether the 2-admissibility of an input graph G is at most p in time O(p⁴ |V(G)|) and space O(|E(G)| + p²). The simple structure of the algorithm makes it easy to implement. We evaluate our implementation on a corpus of 214 real-world networks and find that the algorithm runs efficiently even on networks with millions of edges, that it has a low memory footprint, and that indeed many networks have a small 2-admissibility.

Cite As Get BibTex

Christine Awofeso, Patrick Greaves, Oded Lachish, and Felix Reidl. A Practical Algorithm for 2-Admissibility. In 23rd International Symposium on Experimental Algorithms (SEA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 338, pp. 3:1-3:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LIPIcs.SEA.2025.3

Author Details

Christine Awofeso
  • Birkbeck, University of London, UK
Patrick Greaves
  • Birkbeck, University of London, UK
Oded Lachish
  • Birkbeck, University of London, UK
Felix Reidl
  • Birkbeck, University of London, UK

Supplementary Materials

References

  1. Saeed Akhoondian Amiri, Patrice Ossona de Mendez, Roman Rabinovich, and Sebastian Siebertz. Distributed domination on graph classes of bounded expansion. In Christian Scheideler and Jeremy T. Fineman, editors, Proceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures, SPAA 2018, Vienna, Austria, July 16-18, 2018, pages 143-151. ACM, 2018. URL: https://doi.org/10.1145/3210377.3210383.
  2. Stefan Arnborg, Jens Lagergren, and Detlef Seese. Easy problems for tree-decomposable graphs. Journal of Algorithms, 12(2):308-340, June 1991. URL: https://doi.org/10.1016/0196-6774(91)90006-K.
  3. Christine Awofeso, Patrick Greaves, Oded Lachish, and Felix Reidl. chrisateen/admissibillity-rust. Software, swhId: https://archive.softwareheritage.org/swh:1:dir:71c063dd72478472ce6c4dbec0805028be8003dd;origin=https://github.com/chrisateen/admissibillity-rust;visit=swh:1:snp:855eb3980d829fc685bc267ba6b84761eed00388;anchor=swh:1:rev:73669f38ba4edcc4d6cde548504d34131004c93f (visited on 2025-06-23). URL: https://github.com/chrisateen/admissibillity-rust, URL: https://doi.org/10.4230/artifacts.23612.
  4. Suman K. Bera, Noujan Pashanasangi, and C. Seshadhri. Linear Time Subgraph Counting, Graph Degeneracy, and the Chasm at Size Six. In Thomas Vidick, editor, 11th Innovations in Theoretical Computer Science Conference (ITCS 2020), volume 151 of Leibniz International Proceedings in Informatics (LIPIcs), pages 38:1-38:20, Dagstuhl, Germany, 2020. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ITCS.2020.38.
  5. Michael Breen-McKay, Brian Lavallee, and Blair D. Sullivan. Hardness of the generalized coloring numbers. European Journal of Combinatorics, page 103709, March 2023. URL: https://doi.org/10.1016/j.ejc.2023.103709.
  6. Bruno Courcelle. The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Information and Computation, 85(1):12-75, March 1990. URL: https://doi.org/10.1016/0890-5401(90)90043-H.
  7. E.D. Demaine, M.T. Hajiaghayi, and K. Kawarabayashi. Algorithmic graph minor theory: Decomposition, approximation, and coloring. In 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), pages 637-646, October 2005. URL: https://doi.org/10.1109/SFCS.2005.14.
  8. A. Dobler, M. Sorge, and A. Villedieu. Turbocharging Heuristics for Weak Coloring Numbers. In 30th Annual European Symposium on Algorithms (ESA 2022), volume 244 of Leibniz International Proceedings in Informatics (LIPIcs), pages 44:1-44:18, Dagstuhl, Germany, 2022. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.ESA.2022.44.
  9. Pål Grønås Drange, Markus Dregi, Fedor V. Fomin, Stephan Kreutzer, Daniel Lokshtanov, Marcin Pilipczuk, Michal Pilipczuk, Felix Reidl, Fernando Sánchez Villaamil, Saket Saurabh, Sebastian Siebertz, and Somnath Sikdar. Kernelization and Sparseness: The Case of Dominating Set. In Nicolas Ollinger and Heribert Vollmer, editors, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016), volume 47 of Leibniz International Proceedings in Informatics (LIPIcs), pages 31:1-31:14, Dagstuhl, Germany, 2016. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.STACS.2016.31.
  10. Pål Grønås Drange, Patrick Greaves, Irene Muzi, and Felix Reidl. Computing Complexity Measures of Degenerate Graphs. In 18th International Symposium on Parameterized and Exact Computation (IPEC 2023), volume 285 of Leibniz International Proceedings in Informatics (LIPIcs), pages 14:1-14:21, Dagstuhl, Germany, 2023. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.IPEC.2023.14.
  11. Zdeněk Dvořák. Constant-factor approximation of the domination number in sparse graphs. Eur. J. Comb., 34(5):833-840, 2013. URL: https://doi.org/10.1016/j.ejc.2012.12.004.
  12. Zdeněk Dvořák. On weighted sublinear separators. Journal of Graph Theory, 100(2):270-280, 2022. URL: https://doi.org/10.1002/jgt.22777.
  13. Zdeněk Dvořák, Daniel Král, and Robin Thomas. Deciding first-order properties for sparse graphs. In 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pages 133-142. IEEE, 2010. Google Scholar
  14. Zdenek Dvořák, Daniel Král, and Robin Thomas. Testing first-order properties for subclasses of sparse graphs. J. ACM, 60(5):36:1-36:24, 2013. URL: https://doi.org/10.1145/2499483.
  15. D. Eppstein, M. Löffler, and D. Strash. Listing all maximal cliques in sparse graphs in near-optimal time. In International Symposium on Algorithms and Computation, pages 403-414. Springer, 2010. Google Scholar
  16. Jörg Flum and Martin Grohe. The parameterized complexity of counting problems. SIAM Journal on Computing, 33(4):892-922, 2004. URL: https://doi.org/10.1137/S0097539703427203.
  17. Fedor V. Fomin, Petr A. Golovach, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Meirav Zehavi. Multiplicative parameterization above a guarantee. ACM Trans. Comput. Theory, 13(3):18:1-18:16, 2021. URL: https://doi.org/10.1145/3460956.
  18. Martin Grohe, Stephan Kreutzer, Roman Rabinovich, Sebastian Siebertz, and Konstantinos S. Stavropoulos. Coloring and covering nowhere dense graphs. SIAM J. Discret. Math., 32(4):2467-2481, 2018. URL: https://doi.org/10.1137/18M1168753.
  19. H. A. Kierstead and W. T. Trotter. Planar graph coloring with an uncooperative partner. Journal of Graph Theory, 18(6):569-584, October 1994. URL: https://doi.org/10.1002/jgt.3190180605.
  20. Irene Muzi, Michael P. O'Brien, Felix Reidl, and Blair D. Sullivan. Being Even Slightly Shallow Makes Life Hard. In Kim G. Larsen, Hans L. Bodlaender, and Jean-Francois Raskin, editors, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017), volume 83 of Leibniz International Proceedings in Informatics (LIPIcs), pages 79:1-79:13, Dagstuhl, Germany, 2017. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPIcs.MFCS.2017.79.
  21. W. Nadara, M. Pilipczuk, R. Rabinovich, F. Reidl, and S. Siebertz. Empirical evaluation of approximation algorithms for generalized graph coloring and uniform quasi-wideness. In 17th International Symposium on Experimental Algorithms (SEA 2018), volume 103 of Leibniz International Proceedings in Informatics (LIPIcs), pages 14:1-14:16, Dagstuhl, Germany, 2018. Schloss Dagstuhl - Leibniz-Zentrum für Informatik. URL: https://doi.org/10.4230/LIPICS.SEA.2018.14.
  22. Jaroslav Nešetřil and Patrice Ossona de Mendez. Grad and classes with bounded expansion II. Algorithmic aspects. Eur. J. Comb., 29(3):777-791, 2008. URL: https://doi.org/10.1016/j.ejc.2006.07.014.
  23. Jaroslav Nešetřil and Patrice Ossona de Mendez. Sparsity: Graphs, Structures, and Algorithms, volume 28 of Algorithms and Combinatorics. Springer, 2012. URL: https://doi.org/10.1007/978-3-642-27875-4.
  24. Geevarghese Philip, Venkatesh Raman, and Somnath Sikdar. Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond. ACM Trans. Algorithms, 9(1):11:1-11:23, 2012. URL: https://doi.org/10.1145/2390176.2390187.
  25. Venkatesh Raman, Saket Saurabh, and Sriganesh Srihari. Parameterized algorithms for generalized domination. In Boting Yang, Ding-Zhu Du, and Cao An Wang, editors, Combinatorial Optimization and Applications, Second International Conference, COCOA 2008, St. John’s, NL, Canada, August 21-24, 2008. Proceedings, volume 5165 of Lecture Notes in Computer Science, pages 116-126. Springer, 2008. URL: https://doi.org/10.1007/978-3-540-85097-7_11.
  26. B. A. Reed. Algorithmic Aspects of Tree Width. In Bruce A. Reed and Cláudia L. Sales, editors, Recent Advances in Algorithms and Combinatorics, pages 85-107. Springer, New York, NY, 2003. URL: https://doi.org/10.1007/0-387-22444-0_4.
  27. Felix Reidl. microgravitas/network-corpus. Collection (visited on 2025-06-23). URL: https://github.com/microgravitas/network-corpus, URL: https://doi.org/10.4230/artifacts.23613.
  28. Felix Reidl and Blair D. Sullivan. A Color-Avoiding Approach to Subgraph Counting in Bounded Expansion Classes. Algorithmica, 85(8):2318-2347, August 2023. URL: https://doi.org/10.1007/s00453-023-01096-1.
  29. Felix Reidl, Fernando Sánchez Villaamil, and Konstantinos Stavropoulos. Characterising bounded expansion by neighbourhood complexity. European Journal of Combinatorics, 75:152-168, January 2019. URL: https://doi.org/10.1016/j.ejc.2018.08.001.
  30. Detlef Seese. Linear time computable problems and first-order descriptions. Mathematical Structures in Computer Science, 6(6):505-526, December 1996. URL: https://doi.org/10.1017/S0960129500070079.
  31. Xuding Zhu. Colouring graphs with bounded generalized colouring number. Discret. Math., 309(18):5562-5568, 2009. URL: https://doi.org/10.1016/J.DISC.2008.03.024.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact