Induced Disjoint Paths in Circular-Arc Graphs in Linear Time.

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

Published in: WG (2014)

Keyphrases

disjoint paths
circular arcs
undirected graph
directed graph
straight line
approximation algorithms
line segments
graph structure
worst case
complex networks
minimum cost
noise free
connected components
computer vision
weighted graph
directed acyclic graph
straight line segments
bayesian networks
image processing