Planar 3DM is NP-complete
- 1 June 1986
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 7 (2) , 174-184
- https://doi.org/10.1016/0196-6774(86)90002-7
Abstract
No abstract availableKeywords
This publication has 2 references indexed in Scilit:
- On the complexity of partitioning graphs into connected subgraphsDiscrete Applied Mathematics, 1985
- Planar Formulae and Their UsesSIAM Journal on Computing, 1982