Estimating the number of disjoint edges in simple topological graphs via cylindrical drawings.

Published in: CoRR (2013)

Keyphrases

small number
undirected graph
genetic algorithm
maximum number
graph theoretic
data sets
image processing
computational complexity
pairwise
memory requirements
graph theory
weighted graph
edge information