Reachability and Matching in Single Crossing Minor Free 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
16
Series
41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science: FSTTCS 2021, December 15–17, 2021, Virtual Conference, pp. 1-16, Leibniz International Proceedings in Informatics (LIPIcs) ; Volume 213
Abstract
We show that for each single crossing graph H, a polynomially bounded weight function for all H-minor free graphs G can be constructed in logspace such that it gives nonzero weights to all the cycles in G. This class of graphs subsumes almost all classes of graphs for which such a weight function is known to be constructed in logspace. As a consequence, we obtain that for the class of H-minor free graphs where H is a single crossing graph, reachability can be solved in UL, and bipartite maximum matching can be solved in SPL, which are small subclasses of the parallel complexity class NC. In the restrictive case of bipartite graphs, our maximum matching result improves upon the recent result of Eppstein and Vazirani (SIAM J. Computing 2021), where they show an NC bound for constructing perfect matching in general single crossing minor free graphs.Description
Keywords
Other note
Citation
Datta, S, Gupta, C, Jain, R, Mukherjee, A, Sharma, V & Tewari, R 2021, Reachability and Matching in Single Crossing Minor Free Graphs . in 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science : FSTTCS 2021, December 15–17, 2021, Virtual Conference ., 16, Leibniz International Proceedings in Informatics (LIPIcs), vol. 213, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 1-16, IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Virtual, Online, 15/12/2021 . < https://drops.dagstuhl.de/opus/volltexte/2021/15527/ >