Algorithms for Finding Non-Crossing Paths with Minimum Total Length in Plane Graphs.

Jun-ya Takahashi Hitoshi Suzuki Takao Nishizeki

Published in: ISAAC (1992)

Keyphrases

theoretical analysis
graph theory
worst case
data structure
computational complexity
significant improvement
computationally efficient
maximum clique
data sets
neural network
clustering algorithm
computational cost
optimization problems
data mining techniques
benchmark datasets