Recognizing Map Graphs of Bounded Treewidth
Abstract
A map is a partition of the sphere into interior-disjoint regions homeomorphic to closed disks. Some regions are labeled as nations, while the remaining ones are labeled as holes. A map in which at most k nations touch at the same point is a k-map, while it is hole-free if it contains no holes. A graph is a map graph if there is a bijection between its vertices and the nations of a map, such that two nations touch if and only the corresponding vertices are connected by an edge. We present a fixed-parameter tractable algorithm for recognizing map graphs parameterized by treewidth. Its time complexity is linear in the size of the graph. It reports a certificate in the form of a so-called witness, if the input is a yes-instance. Our algorithmic framework is general enough to test, for any k, if the input graph admits a k-map or a hole-free k-map.
References
[1]
Angelini, P., Bekos, M.A., Da Lozzo, G., Gronemann, M., Montecchiani, F., Tappini, A.: Recognizing map graphs of bounded treewidth. In: SWAT. LIPIcs, vol. 227, pp. 8–1818. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Tórshavn, Faroe Islands (2022)
[2]
Chen, Z., Grigni, M., Papadimitriou, C.H.: Planar map graphs. In: STOC, pp. 514–523. ACM, Dallas, Texas, USA (1998)
[3]
Dujmovic V, Eppstein D, and Wood DR Structure of graphs with locally restricted crossings SIAM J. Discret. Math. 2017 31 2 805-824
[4]
Angelini P, Da Lozzo G, Di Battista G, Frati F, Patrignani M, and Rutter I Intersection-link representations of graphs J. Graph Algorithms Appl. 2017 21 4 731-755
[5]
Brandenburg FJ Characterizing 5-map graphs by 2-fan-crossing graphs Discret. Appl. Math. 2019 268 10-20
[6]
Brandenburg FJ Characterizing and recognizing 4-map graphs Algorithmica 2019 81 5 1818-1843
[7]
Chen, Z., He, X., Kao, M.: Nonplanar topological inference and political-map graphs. In: SODA, pp. 195–204. ACM/SIAM, Baltimore, Maryland, USA (1999)
[8]
Chen Z Approximation algorithms for independent sets in map graphs J. Algorithms 2001 41 1 20-40
[9]
Demaine ED, Fomin FV, Hajiaghayi MT, and Thilikos DM Fixed-parameter algorithms for (, )-center in planar graphs and map graphs ACM Trans. Algorithms 2005 1 1 33-47
[10]
Fomin, F.V., Lokshtanov, D., Misra, N., Saurabh, S.: Planar f-deletion: Approximation, kernelization and optimal FPT algorithms. In: FOCS, pp. 470–479. IEEE, New Brunswick, NJ, USA (2012)
[11]
Fomin, F.V., Lokshtanov, D., Panolan, F., Saurabh, S., Zehavi, M.: Decomposition of map graphs with applications. In: ICALP. LIPIcs, vol. 132, pp. 60–16015. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2019)
[12]
Fomin, F.V., Lokshtanov, D., Saurabh, S.: Bidimensionality and geometric graphs. In: SODA, pp. 1563–1575. SIAM, Kyoto, Japan (2012)
[13]
Chen, Z., Grigni, M., Papadimitriou, C.H.: Map graphs. J. ACM 49(2), 127–138 (2002).
[14]
Thorup, M.: Map graphs in polynomial time. In: FOCS, pp. 396–405. IEEE, Palo Alto, California, USA (1998)
[15]
Chen Z, Grigni M, and Papadimitriou CH Recognizing hole-free 4-map graphs in cubic time Algorithmica 2006 45 2 227-262
[16]
Mnich M, Rutter I, and Schmidt JM Linear-time recognition of map graphs with outerplanar witness Discret. Optim. 2018 28 63-77
[17]
Chen Z New bounds on the edge number of a -map graph J. Graph Theory 2007 55 4 267-290
[18]
Dujmović V, Joret G, Micek P, Morin P, Ueckerdt T, and Wood DR Planar graphs have bounded queue-number J. ACM 2020 67 4 22-12238
[19]
Bekos, M.A., Da Lozzo, G., Hlinený, P., Kaufmann, M.: Graph product structure for h-framed graphs. In: ISAAC. LIPIcs, vol. 248, pp. 23–12315. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Seoul, Korea (2022)
[20]
Brandenburg, F.J.: Book embeddings of k-map graphs. CoRR abs/2012.06874 (2020)
[21]
Le H and Le VB Map graphs having witnesses of large girth Theor. Comput. Sci. 2019 772 143-148
[22]
Le, H., Le, V.B.: Constrained representations of map graphs and half-squares. In: MFCS. LIPIcs, vol. 138, pp. 13–11315. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Aachen, Germany (2019)
[23]
Le H and Le VB Hardness and structural results for half-squares of restricted tree convex bipartite graphs Algorithmica 2019 81 11–12 4258-4274
[24]
Tsukiyama S, Ide M, Ariyoshi H, and Shirakawa I A new algorithm for generating all the maximal independent sets SIAM J. Comput. 1977 6 3 505-517
[25]
Downey RG and Fellows MR Parameterized Complexity 1999 New York, USA Monographs in Computer Science. Springer
[26]
Robertson, N., Seymour, P.D.: Graph minors. II. algorithmic aspects of tree-width. J. Algorithms 7(3), 309–322 (1986)
[27]
Courcelle, B.: The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Inf. Comput. 85(1), 12–75 (1990)
[28]
Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer (2015)
[29]
Di Giacomo E, Liotta G, and Montecchiani F Orthogonal planarity testing of bounded treewidth graphs J. Comput. Syst. Sci. 2022 125 129-148
[30]
Jansen, B.M.P., Lokshtanov, D., Saurabh, S.: A near-optimal planarization algorithm. In: SODA, pp. 1802–1811. SIAM, Oregon, USA (2014)
[31]
Kociumaka T and Pilipczuk M Deleting vertices to graphs of bounded genus Algorithmica 2019 81 9 3655-3691
[32]
Bodlaender HL A linear-time algorithm for finding tree-decompositions of small treewidth SIAM J. Comput. 1996 25 6 1305-1317
[33]
Bodlaender HL and Kloks T Efficient and constructive algorithms for the pathwidth and treewidth of graphs J. Algorithms 1996 21 2 358-402
[34]
Kloks, T.: Treewidth, Computations and Approximations. LNCS, vol. 842. Springer, Germany (1994)
[35]
Cormode G Data sketching ACM Queue 2017 15 2 60
[36]
Tarjan, R.E., Vishkin, U.: Finding biconnected components and computing tree functions in logarithmic parallel time (extended summary). In: FOCS, pp. 12–20. IEEE, West Palm Beach, Florida, USA (1984)
[37]
Hüffner F, Komusiewicz C, Moser H, and Niedermeier R Fixed-parameter algorithms for cluster vertex deletion Theory Comput. Syst. 2010 47 1 196-217
[38]
Courcelle B, Engelfriet J, and Rozenberg G Handle-rewriting hypergraph grammars J. Comput. Syst. Sci. 1993 46 2 218-270
Index Terms
- Recognizing Map Graphs of Bounded Treewidth
Index terms have been assigned to the content through auto-classification.
Recommendations
A tight lower bound for Vertex Planarization on graphs of bounded treewidth
In the Vertex Planarization problem one asks to delete the minimum possible number of vertices from an input graph to obtain a planar graph. The parameterized complexity of this problem, parameterized by the solution size (the number of deleted vertices)...
Hitting forbidden subgraphs in graphs of bounded treewidth
We study the complexity of a generic hitting problem H-Subgraph Hitting, where given a fixed pattern graph H and an input graph G, the task is to find a set XV(G) of minimum size that hits all subgraphs of G isomorphic to H. In the colorful variant of ...
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
The subgraph isomorphism problem, that of finding a copy of one graph in another, has proved to be intractable except when certain restrictions are placed on the inputs. In this paper, we introduce a new property for graphs along with an associated ...
Comments
Information & Contributors
Information
Published In
© The Author(s) 2023.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 27 October 2023
Accepted: 09 October 2023
Received: 03 July 2022
Author Tags
Qualifiers
- Research-article
Funding Sources
- Università degli Studi di Perugia
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in