Planarity, Determinants, Permanents, and (Unique) Matchings

DOI10.1007/978-3-540-74510-5_14zbMath1188.68151MaRDI QIDQ5900038

Meena Mahajan, Samir Datta, Nutan Limaye, Raghav Kulkarni

Publication date: 3 June 2008

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.384.570

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

Log-space algorithms for paths and matchings in \(k\)-trees, Planar and grid graph reachability problems, Deterministically isolating a perfect matching in bipartite planar graphs