A note on Lerda and Majorani's minimum crossing algorithm

DOI10.1007/BF02575825zbMath0293.05109MaRDI QIDQ1211999

F. Rubin

Publication date: 1974

Published in: Calcolo (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (2)

Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ Comments on a note by F. Rubin

Cites Work

• An algorithm for connecting n points with a minimum number of crossings
• Un algorithme pour relier N points

This page was built for publication: A note on Lerda and Majorani's minimum crossing algorithm