On the Crossing Number of Complete Graphs.

Oswin Aichholzer Franz Aurenhammer Hannes Krasser

Published in: Computing (2006)

Keyphrases

small number
databases
information retrieval
artificial intelligence
information systems
computational complexity
lower bound
np hard
graph theory
fixed number
graph partitioning