Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs
Loading...
Access rights
openAccess
publishedVersion
URL
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
View publication in the Research portal (opens in new window)
View/Open full text file from the Research portal (opens in new window)
Other link related to publication (opens in new window)
Date
2021-11-29
Department
Major/Subject
Mcode
Degree programme
Language
en
Pages
15
Series
41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science: FSTTCS 2021, December 15–17, 2021, Virtual Conference, pp. 1-15, Leibniz International Proceedings in Informatics (LIPIcs) ; Volume 213
Abstract
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.Description
Keywords
Other note
Citation
Gupta, C, Jain, R & Tewari, R 2021, Time Space Optimal Algorithm for Computing Separators in Bounded Genus Graphs . in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2021, December 15–17, 2021, Virtual Conference ., 23, Leibniz International Proceedings in Informatics (LIPIcs), vol. 213, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 1-15, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, Online, 15/12/2021 . < https://drops.dagstuhl.de/opus/frontdoor.php?source_opus=15534 >