Toggle navigation
Login
Toggle navigation
View Item
UWSpace Home
University of Waterloo
Waterloo Research
View Item
UWSpace Home
University of Waterloo
Waterloo Research
View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.
Finding an induced path that is not a shortest path
View/
Open
Finding shorthest path.pdf (189.3Kb)
Date
2021-07
Author
Berger, Eli
Seymour, Paul
Spirkl, Sophie
Metadata
Show full item record
Statistics
View Google statistics
Abstract
We give a polynomial-time algorithm that, with input a graph G and two vertices u; v of G, decides whether there is an induced uv-path that is longer than the shortest uv-path.
URI
https://doi.org/10.1016/j.disc.2021.112398
http://hdl.handle.net/10012/18523
Collections
Combinatorics and Optimization
Waterloo Research
Cite this version of the work
Eli Berger, Paul Seymour, Sophie Spirkl (2021). Finding an induced path that is not a shortest path. UWSpace.
http://hdl.handle.net/10012/18523
Other formats
BibTeX
RIS
EndNote
The following license files are associated with this item:
Creative Commons
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International
Search UWSpace
Search UWSpace
This Collection
Information
UWSpace Guide
Accessibility
Contact Us
Browse
All of UWSpace
Communities & Collections
By Issue Date
Authors
Titles
Subjects
Type
Supervisor
This Collection
By Issue Date
Authors
Titles
Subjects
Type
Supervisor
My Account
Login