Computing and Counting Longest Paths on Circular-Arc Graphs in Polynomial Time.

George B. Mertzios Ivona Bezáková

Published in: Electron. Notes Discret. Math. (2011)

Keyphrases

circular arcs
straight line segments
straight line
bounded treewidth
shortest path
line segments
polynomial time complexity
digital images
np complete