Shortest cycle through specified elements

We give a randomized algorithm that finds a shortest simple cycle through a given set of k vertices or edges in an n -vertex undirected graph in time 2 k n O (1).

Authors

• Andreas Björklund
• Thore Husfeldt
• Nina Taslaman

Keywords

No keywords are indexed for this paper.