Abstract
We introduce the parameter of block elimination distance as a measure of how close a graph is to some particular graph class. Formally, given a graph class \({\mathcal {G}}\), the class \({\mathcal {B}}({\mathcal {G}})\) contains all graphs whose blocks belong to \({\mathcal {G}}\) and the class \({\mathcal {A}}({\mathcal {G}})\) contains all graphs where the removal of a vertex creates a graph in \({\mathcal {G}}\). Given a hereditary graph class \({\mathcal {G}}\), we recursively define \({{\mathcal {G}}}^{(k)}\) so that \({\mathcal {G}}^{(0)}={\mathcal {B}}({\mathcal {G}})\) and, if \(k\ge 1\), \({\mathcal {G}}^{(k)}={\mathcal {B}}({\mathcal {A}}({\mathcal {G}}^{(k-1)}))\). We show that, for every non-trivial hereditary class \({\mathcal {G}}\), the problem of deciding whether \(G\in {\mathcal {G}}^{(k)}\) is NP-complete. We focus on the case where \({\mathcal {G}}\) is minor-closed and we study the minor obstruction set of \({\mathcal {G}}^{(k)}\) i.e., the minor-minimal graphs not in \({\mathcal {G}}^{(k)}\). We prove that the size of the obstructions of \({\mathcal {G}}^{(k)}\) is upper bounded by some explicit function of k and the maximum size of a minor obstruction of \({\mathcal {G}}\). This implies that the problem of deciding whether \(G\in {\mathcal {G}}^{(k)}\) is constructively fixed parameter tractable, when parameterized by k. Finally, we give two graph operations that generate members of \({\mathcal {G}}^{(k)}\) from members of \({\mathcal {G}}^{(k-1)}\) and we prove that this set of operations is complete for the class \({\mathcal {O}}\) of outerplanar graphs.Please check and confirm if the authors Given and Family names have been correctly identified for author znur YaŸar Diner.All authors names have been identified correctly.Please confirm if the corresponding author is correctly identified. Amend if necessary.This is correct
Similar content being viewed by others
Data Availability
Data sharing not applicable to this article as no datasets were generated or analysed during the current study.
Notes
It is easy to see that \(\mathsf{ed}_{\mathcal {G}}(G)\) is logarithmically lower-bounded by the maximum number of cut-vertices in a path of G.
A class is non-trivial if it contains at least one non-empty graph and is not the class of all graphs.
References
Adler, I., Grohe, M., Kreutzer, S.: Computing excluded minors. In: Proceedings of the 19th annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 641–650 (2008). https://doi.org/10.1145/1347082.1347153
Akanksha, A., Lawqueen, K., Daniel, L., Fahad, P., Ramanujan, M.S., Saket, Meirav, Z.: Deleting, eliminating and decomposing to hereditary classes are all fpt-equivalent. In: Proceedings of the 2022 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1976–2004 (2022). https://doi.org/10.1137/1.9781611977073.79
Agrawal, A., Kanesh, L., Panolan, F., Ramanujan, M.S., Saket, S.: An FPT algorithm for elimination distance to bounded degree graphs. In: Proceedings of the 38th International Symposium on Theoretical Aspects of Computer Science (STACS), volume 187 of LIPIcs, pp. 5:1–5:11. Schloss Dagstuhl-Leibniz-Zentrum für Informatik, (2021). https://doi.org/10.4230/LIPIcs.STACS.2021.5
Akanksha, A., Ramanujan, M.S.: On the parameterized complexity of clique elimination distance. In: Proceedings of the 15th International Symposium on Parameterized and Exact Computation (IPEC), vol. 180, pp. 1–13 (2020). https://doi.org/10.4230/LIPIcs.IPEC.2020.1
Bodlaender, H.L., Heggernes, P., Lokshtanov, D.: Graph modification problems (dagstuhl seminar 14071). Dagstuhl Rep. 4(2), 38–59 (2014). https://doi.org/10.4230/DagRep.4.2.38
Bulian, J., Dawar, A.: Graph isomorphism parameterized by elimination distance to bounded degree. Algorithmica 75(2), 363–382 (2016). https://doi.org/10.1007/s00453-015-0045-3
Bulian, J., Dawar, A.: Fixed-parameter tractable distances to sparse graph classes. Algorithmica 79(1), 139–158 (2017). https://doi.org/10.1007/s00453-016-0235-7
Chuzhoy, J.: Improved bounds for the flat wall theorem. In: Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 256–275 (2015). https://doi.org/10.1137/1.9781611973730.20
Crespelle, C., Drange, P.G., Fomin, F.V., Golovach, P.A.: A survey of parameterized algorithms and the complexity of edge modification (2020). arXiv:2001.06867
Derek, G., Corneil, C.C.: Gotlieb: an efficient algorithm for graph isomorphism. J. ACM 17(1), 51–64 (1970). https://doi.org/10.1145/321556.321562
Fomin, F.V., Saurabh, S., Misra, N.: Graph modification problems: a modern perspective. In: Proceedings of the 9th International Workshop on Frontiers in Algorithmics (FAW), volume 9130 of LNCS, pp. 3–6. Springer (2015). https://doi.org/10.1007/978-3-319-19647-3_1
Gabriel, A.D.: In abstrakten graphen vorhandene vollständige 4-graphen und ihre unterteilungen. Math. Nachr. 22(1–2), 61–85 (1960). https://doi.org/10.1002/mana.19600220107
Guo, J., Hüffner, F., Niedermeier, R.: A structural view on parameterizing problems: distance from triviality. In: Proceedings of the 1st International Workshop Parameterized and Exact Computation (IWPEC), volume 3162 of Lecture Notes in Computer Science, pp. 162–173. Springer (2004). https://doi.org/10.1007/978-3-540-28639-4_15
Hopcroft, J.E., Tarjan, R.E.: A V2 algorithm for determining isomorphism of planar graphs. Inf. Process. Lett. 1(1), 32–34 (1971). https://doi.org/10.1016/0020-0190(71)90019-6
Hopcroft, J.E., Tarjan, R.E.: Isomorphism of planar graphs. In: Complexity of Computer Computations, The IBM Research Symposia Series, pp. 131–152 (1972). https://doi.org/10.1007/978-1-4684-2001-2_13
Huynh, T., Joret, G., Michał, P.M., Seweryn, T., Wollan, P.: Excluding a ladder (2020). arXiv:2002.00496
Jansen, B.M.P., de Kroon, J.J.H., Wlodarczyk, M.: Vertex deletion parameterized by elimination distance and even less. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing (STOC), pp. 1757–1769. ACM (2021). https://doi.org/10.1145/3406325.3451068
Kawarabayashi, K., Kobayashi, Y., Bruce, R.: The disjoint paths problem in quadratic time. J. Comb. Theory Ser. B 102(2), 424–435 (2011). https://doi.org/10.1016/j.jctb.2011.07.004
Kawarabayashi, K., Wollan, P.: A shorter proof of the graph minor algorithm: the unique linkage theorem. In: Proceedings of the 42nd ACM Symposium on Theory of Computing (STOC), pp. 687–694 (2010). https://doi.org/10.1145/1806689.1806784
Lindermayr, A., Siebertz, S., Vigny, A.: Elimination distance to bounded degree on planar graphs. In: Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science (MFCS), volume 170 of LIPIcs, pp. 65:1–65:12 (2020). https://doi.org/10.4230/LIPIcs.MFCS.2020.65
Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Comb. Theory Ser. B 63(1), 65–110 (1995). https://doi.org/10.1006/jctb.1995.1006
Sau, I., Stamoulis, G., Thilikos, D.M.: An FPT-algorithm for recognizing $k$-apices of minor-closed graph classes. In: Proceedings of the 47th International Colloquium on Automata, Languages, and Programming (ICALP), volume 168 of LIPIcs, pp. 95:1–95:20 (2020). https://doi.org/10.4230/LIPIcs.ICALP.2020.95
Sau, I., Stamoulis, G., Thilikos, D.M.: $k$-apices of minor-closed graph classes. I. Bounding the obstructions (2021). arXiv:2103.00882
Sau, I., Stamoulis, G., Thilikos, D.M.: $k$-apices of minor-closed graph classes. II. Parameterized algorithms. ACM Trans. Algorithms (2022). https://doi.org/10.1145/3519028
Acknowledgements
Öznur Yaşar Diner is grateful to the members of the research group GAPCOMB for hosting a research stay at Universitat Politècnica de Catalunya. Öznur Yaşar Diner was supported by the Spanish Agencia Estatal de Investigacion under project MTM2017-82166-P. Giannos Stamoulis and Dimitrios M. Thilikos were supported by the ANR projects DEMOGRAPH (ANR-16-CE40-0028), ESIGMA (ANR-17-CE23-0010), and the French-German Collaboration ANR/DFG Project UTMA (ANR-20-CE92-0027).
Funding
Öznur Yaşar Diner was supported by the Spanish Agencia Estatal de Investigacion under project MTM2017-82166-P. Giannos Stamoulis and Dimitrios M. Thilikos were supported by the ANR projects DEMOGRAPH (ANR-16-CE40-0028), ESIGMA (ANR-17-CE23-0010), and the French-German Collaboration ANR/DFG Project UTMA (ANR-20-CE92-0027)
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of interest
The authors have no relevant financial or non-financial interests to disclose.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Diner, Ö.Y., Giannopoulou, A.C., Stamoulis, G. et al. Block Elimination Distance. Graphs and Combinatorics 38, 133 (2022). https://doi.org/10.1007/s00373-022-02513-y
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s00373-022-02513-y
Keywords
- Graph minors
- Block elimination distance
- Elimination distance
- Minor obstructions
- Parameterized algorithms