Results

**1 - 3**of**3**### Improved lower bounds for the 2-page crossing numbers of Km,n and Kn via semidefinite programming

, 2011

"... ..."

### unknown title

"... The simplest graph drawing method is that of putting the vertices of a graph on a line (spine) and drawing the edges as half-circles in κ half planes. Such drawings are called κ-page book drawings. Edge crossing minimisation is the most important goal in linear Very Large Scale Integration (VLSI) ci ..."

Abstract
- Add to MetaCart

(Show Context)
The simplest graph drawing method is that of putting the vertices of a graph on a line (spine) and drawing the edges as half-circles in κ half planes. Such drawings are called κ-page book drawings. Edge crossing minimisation is the most important goal in linear Very Large Scale Integration (VLSI) circuit design and Quantum-dot Cellular Automata (QCA), since a smaller number of crossings means lower cost. The minimum