An algorithm for connectingN points with a minimum number of crossings
- 1 September 1964
- journal article
- Published by Springer Nature in Calcolo
- Vol. 1 (3) , 257-265
- https://doi.org/10.1007/bf02576900
Abstract
No abstract availableKeywords
This publication has 3 references indexed in Scilit:
- The Reduction of Redundancy in Solving Prime Implicant TablesIRE Transactions on Electronic Computers, 1962
- An Essay on Prime Implicant TablesJournal of the Society for Industrial and Applied Mathematics, 1961
- An Algorithm for Path Connections and Its ApplicationsIEEE Transactions on Electronic Computers, 1961