Computing and counting longest paths on circular-arc graphs in polynomial time.

George B. Mertzios Ivona Bezáková

Published in: Discret. Appl. Math. (2014)

Keyphrases

circular arcs
straight line segments
straight line
polynomial time complexity
bounded treewidth
face recognition
np complete
computer vision
line segments