eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Leibniz International Proceedings in Informatics
1868-8969
2021-11-29
23:1
23:15
10.4230/LIPIcs.FSTTCS.2021.23
article
Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs
Gupta, Chetan
1
Jain, Rahul
2
https://orcid.org/0000-0002-8567-9475
Tewari, Raghunath
3
Aalto University, Finland
Fernuniversität in Hagen, Germany
Indian Institute of Technology Kanpur, India
A graph separator is a subset of vertices of a graph whose removal divides the graph into small components. Computing small graph separators for various classes of graphs is an important computational task. In this paper, we present a polynomial-time algorithm that uses O(g^{1/2} n^{1/2} log n)-space to find an O(g^{1/2} n^{1/2})-sized separator of a graph having n vertices and embedded on an orientable surface of genus g.
https://drops.dagstuhl.de/storage/00lipics/lipics-vol213-fsttcs2021/LIPIcs.FSTTCS.2021.23/LIPIcs.FSTTCS.2021.23.pdf
Graph algorithms
space-bounded algorithms
surface embedded graphs
reachability
Euler genus
algorithmic graph theory
computational complexity theory