Induced disjoint paths in circular-arc graphs in linear time.

Petr A. Golovach Daniël Paulusma Erik Jan van Leeuwen

Published in: Theor. Comput. Sci. (2016)

Keyphrases

disjoint paths
circular arcs
undirected graph
directed graph
straight line
approximation algorithms
line segments
worst case
critical points
graph structure
spanning tree
straight line segments
optical flow
active contours
directed acyclic graph