Generalized planar matching
From MaRDI portal
Publication:3357535
DOI10.1016/0196-6774(90)90001-UzbMath0731.68041OpenAlexW2025940785MaRDI QIDQ3357535
Leighton, Tom, Larry Snyder, Fran Berman, David S. Johnson, Peter W. Shor
Publication date: 1990
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(90)90001-u
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items (20)
Simplified group activity selection with group size constraints ⋮ Tiling figures of the plane with two bars ⋮ An approximation algorithm for maximum \(P_{3}\)-packing in subcubic graphs ⋮ Network-Based Dissolution ⋮ Maximum tree-packing in time \(O(n^{5/2})\) ⋮ Tiling with Squares and Packing Dominos in Polynomial Time ⋮ Maximum tree-packing in time O(n5/2) ⋮ Tile invariants: New horizons. ⋮ Winner determination in geometrical combinatorial auctions ⋮ Combinatorial and computational aspects of graph packing and graph decomposition ⋮ Maximum packing for biconnected outerplanar graphs ⋮ Illuminating disjoint line segments in the plane ⋮ Maximum packing for \(k\)-connected partial \(k\)-trees in polynomial time ⋮ Star Partitions of Perfect Graphs ⋮ Induced packing of odd cycles in planar graphs ⋮ A Survey of the Game “Lights Out!” ⋮ Revising Johnson's table for the 21st century ⋮ Network-Based Vertex Dissolution ⋮ Forests, colorings and acyclic orientations of the square lattice ⋮ Maximum bounded \(H\)-matching is Max SNP-complete
This page was built for publication: Generalized planar matching
