Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs
From MaRDI portal
Publication:5089210
DOI10.4230/LIPICS.MFCS.2020.43OpenAlexW3082057387MaRDI QIDQ5089210FDOQ5089210
Authors: Chetan Gupta, Vimal Raj Sharma, Raghunath Tewari 
Publication date: 18 July 2022
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2020/12709/pdf/LIPIcs-MFCS-2020-43.pdf/
Cites Work
- Paths, Trees, and Flowers
- Undirected connectivity in log-space
- Storing a Sparse Table with 0 (1) Worst Case Access Time
- Matching is as easy as matrix inversion
- Making Nondeterminism Unambiguous
- Isolation, matching, and counting uniform and nonuniform upper bounds
- Space complexity of perfect matching in bounded genus bipartite graphs
- Title not available (Why is that?)
- Constant Depth Reducibility
- Trading determinism for time in space bounded computations
- The Polynomially Bounded Perfect Matching Problem Is in NC 2
- Bipartite perfect matching is in quasi-NC
- Compressed Decision Problems in Hyperbolic Groups.
- Derandomizing isolation lemma for \(K_{3,3}\)-free and \(K_5\)-free bipartite graphs
This page was built for publication: Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5089210)
