ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs.

Fedor V. Fomin Daniel Lokshtanov Fahad Panolan Saket Saurabh Meirav Zehavi

Published in: CoRR (2020)

Keyphrases

worst case
graph theory
lower bound
computational complexity
upper bound
data structure
computational cost
orders of magnitude
data mining
significant improvement
np complete
computationally efficient
directed graph
graph model
minimum spanning tree
random graphs