AI Chat AI Image Generator AI Video Text to Speech

Planar Perfect Matching is in NC

09/22/2017
∙
by   Piotr Sankowski, et al.
∙
0
∙

In this paper we show that the problem of computing perfect matchings in planar graphs is in NC.

READ FULL TEXT

page 1

page 2

page 3

page 4

Related Research

research
∙ 09/22/2017

Planar Graph Perfect Matching is in NC

Is perfect matching in NC? That is, is there a deterministic fast parall...
0 Nima Anari, et al. ∙
research
∙ 05/28/2020

On the expected number of perfect matchings in cubic planar graphs

A well-known conjecture by Lovász and Plummer from the 1970s asserted th...
0 Marc Noy, et al. ∙
research
∙ 01/03/2018

Circuit Complexity of Bounded Planar Cutwidth Graph Matching

Recently, perfect matching in bounded planar cutwidth bipartite graphs (...
0 Aayush Ojha, et al. ∙
research
∙ 07/09/2015

Planar Ultrametric Rounding for Image Segmentation

We study the problem of hierarchical clustering on planar graphs. We for...
0 Julian Yarkony, et al. ∙
research
∙ 02/20/2023

Quantum routing in planar graph using perfect state transfer

In this article, we consider a spin-spin interaction network governed by...
0 Supriyo Dutta, et al. ∙
research
∙ 09/26/2022

Quantum-Inspired Perfect Matching under Vertex-Color Constraints

We propose and study the graph-theoretical problem PM-VC: perfect matchi...
0 Moshe Y. Vardi, et al. ∙

Please sign up or login with your details

Forgot password? Click here to reset

Out of credits

Refill your membership to continue using DeepAI

Stripe
Paypal