Vertex insertion approximates the crossing number of apex graphs.

Markus Chimani Petr Hlinený Petra Mutzel

Published in: Eur. J. Comb. (2012)

Keyphrases

undirected graph
fixed number
small number
bipartite graph
finite number
spanning tree
data sets
databases
neural network
information retrieval
artificial intelligence
image segmentation
computational complexity
directed graph
graph structure