Generalized planar matching☆
References (15)
- et al.
Planar 3DM is NP-complete
J. Algorithms
(1986) - et al.
Optimal packing and covering in the plane are NP-complete
Inform. Process. Lett.
(1981) Approximation algorithms for NP-complete problems on planar graphs
- et al.
- et al.
Optimal Tile Salvage
- et al.
On the Complexity of Partitioning Graphs into Connected Subgraphs
- et al.
Computing a perfect strategy for n × n chess requires exponential time in n
J. Combin. Theory Ser. A
(1981)
There are more references available in the full text version of this article.
Cited by (43)
Revising Johnson's table for the 21st century
2022, Discrete Applied MathematicsWinner determination in geometrical combinatorial auctions
2017, European Journal of Operational ResearchInduced packing of odd cycles in planar graphs
2012, Theoretical Computer ScienceCombinatorial and computational aspects of graph packing and graph decomposition
2007, Computer Science ReviewAn approximation algorithm for maximum P<inf>3</inf>-packing in subcubic graphs
2006, Information Processing LettersTile invariants: New horizons
2003, Theoretical Computer Science
- ☆
Fran Berman and Larry Snyder were supported by a Purdue Research Foundation Summer XL Grant, ONR Contract N00014-8-K-0360, and NSF Grant CS-80-05387. Tom Leighton and Peter Shor were supported by Air Force contract OSR-82-0326, DARPA Contract N00014-80-C-0622, and the Bantrell Foundation.
Copyright © 1990 Published by Elsevier Inc.