Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
An algorithm for connecting n points with a minimum number of crossings - MaRDI portal

An algorithm for connecting n points with a minimum number of crossings

From MaRDI portal

Publication:2522668

Jump to:navigation, search

DOI10.1007/BF02576900zbMath0141.41201MaRDI QIDQ2522668

Publication date: 1964

Published in: Calcolo (Search for Journal in Brave)

zbMATH Keywords

Related Items (4)

Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ A note on Lerda and Majorani's minimum crossing algorithm ⋮ Comments on a note by F. Rubin ⋮ Un algorithme pour relier N points

Cites Work

An Essay on Prime Implicant Tables

This page was built for publication: An algorithm for connecting n points with a minimum number of crossings

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2522668&oldid=15249271"