scientific article; zbMATH DE number 6292596
From MaRDI portal
Publication:5414566
DOI10.4086/cjtcs.2008.004zbMath1286.05052OpenAlexW4235066562MaRDI QIDQ5414566
Raghav Kulkarni, Meena Mahajan, Kasturi R. Varadarajan
Publication date: 6 May 2014
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/cjtcs.2008.004
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Perfect graphs (05C17)
Related Items (4)
Space complexity of perfect matching in bounded genus bipartite graphs ⋮ Counting the number of perfect matchings in \(K_{5}\)-free graphs ⋮ Planar Maximum Matching: Towards a Parallel Algorithm ⋮ NC Algorithms for Computing a Perfect Matching and a Maximum Flow in One-Crossing-Minor-Free Graphs
This page was built for publication:
