Planarizing gadgets for perfect matching do not exist
To reduce a graph problem to its planar version, a standard technique is to replace
crossings in a drawing of the input graph by planarizing gadgets. We show unconditionally …
crossings in a drawing of the input graph by planarizing gadgets. We show unconditionally …
[PDF][PDF] Improved bounds for bipartite matching on surfaces
We exhibit the following new upper bounds on the space complexity and the parallel
complexity of the Bipartite Perfect Matching (BPM) problem for graphs of small genus:(1) …
complexity of the Bipartite Perfect Matching (BPM) problem for graphs of small genus:(1) …
Space-efficient approximation scheme for maximum matching in sparse graphs
Abstract We present a Logspace Approximation Scheme (LSAS), ie an approximation
algorithm for maximum matching in planar graphs (not necessarily bipartite) that achieves …
algorithm for maximum matching in planar graphs (not necessarily bipartite) that achieves …
On the power of isolation in planar graphs
R Kulkarni - ACM Transactions on Computation Theory (TOCT), 2011 - dl.acm.org
We study (deterministic) isolation for certain structures in directed and undirected planar
graphs. The motivation for undertaking such a study comes from recent positive results on …
graphs. The motivation for undertaking such a study comes from recent positive results on …
Planar maximum matching: Towards a parallel algorithm
Perfect matchings in planar graphs have been extensively studied and understood in the
context of parallel complexity [PW Kastelyn, 1967; Vijay Vazirani, 1988; Meena Mahajan and …
context of parallel complexity [PW Kastelyn, 1967; Vijay Vazirani, 1988; Meena Mahajan and …
Bounded treewidth and space-efficient linear algebra
Motivated by a recent result of Elberfeld, Jakoby and Tantau EJT10 showing that MSO
properties are Logspace computable on graphs of bounded treewidth, we consider the …
properties are Logspace computable on graphs of bounded treewidth, we consider the …
[图书][B] Computational complexity and decidability of tileability
JCC Yang - 2013 - search.proquest.com
For finite polyomino regions, tileability by a pair of rectangles is NP-complete for all but trivial
cases yet can be solved in quadratic time for simply connected regions. Through a series of …
cases yet can be solved in quadratic time for simply connected regions. Through a series of …
Space complexity of optimization problems in planar graphs
S Datta, R Kulkarni - International Conference on Theory and Applications …, 2014 - Springer
We initiate the study of space complexity of certain optimization problems restricted to planar
graphs. We provide upper bounds and hardness results in space complexity for some of …
graphs. We provide upper bounds and hardness results in space complexity for some of …
Simultaneous time-space upper bounds for certain problems in planar graphs
D Chakraborty, R Tewari - arXiv preprint arXiv:1502.02135, 2015 - arxiv.org
In this paper, we show that given a weighted, directed planar graph $ G $, and any
$\epsilon> 0$, there exists a polynomial time and $ O (n^{\frac {1}{2}+\epsilon}) $ space …
$\epsilon> 0$, there exists a polynomial time and $ O (n^{\frac {1}{2}+\epsilon}) $ space …