Generalized planar matching
Authors:
- Fran BermanFBFran Berman
- David JohnsonDJDavid Johnson
- Tom LeightonTLTom Leighton
- Peter W ShorPSPeter W Shor
- Larry SnyderLSLarry Snyder
- 1 June 1990
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 11 (2) , 153-184
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Rectilinear planar layouts and bipolar orientations of planar graphsDiscrete & Computational Geometry, 1986
- Planar 3DM is NP-completeJournal of Algorithms, 1986
- N by N Checkers is Exptime CompleteSIAM Journal on Computing, 1984
- The NP-completeness column: An ongoing guideJournal of Algorithms, 1982
- Planar Formulae and Their UsesSIAM Journal on Computing, 1982
- Computing a perfect strategy for n × n chess requires time exponential in nJournal of Combinatorial Theory, Series A, 1981
- Optimal packing and covering in the plane are NP-completeInformation Processing Letters, 1981
- Universality considerations in VLSI circuitsIEEE Transactions on Computers, 1981