Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference16 articles.
1. An O(n log n) minimal spanning tree algorithm for N points in the plane;Chang;BIT,1986
2. Constrained Delaunay triangulations;Chew;Algorithmica,1989
3. Optimal packing and covering in the plane are NP-complete;Folwer;Inform. Process. Lett.,1981
4. Computers and Intractability: A Guide to the Theory of NP-Completeness;Garey,1979
5. Recognition and self-organization of nodes into DTMDA nets;Hauptschein;IEEE Trans. Aerospace Electron. Systems,1981