Login / Signup
Induced Disjoint Paths in Circular-Arc Graphs in Linear Time.
Petr A. Golovach
Daniël Paulusma
Erik Jan van Leeuwen
Published in:
CoRR (2014)
Keyphrases
</>
disjoint paths
circular arcs
undirected graph
directed graph
straight line
approximation algorithms
line segments
graph structure
worst case
special case
random walk
hough transform
complex networks
weighted graph
spanning tree
gray scale
image processing
noise free
upper bound