Finding an induced path that is not a shortest path
| dc.contributor.author | Berger, Eli | |
| dc.contributor.author | Seymour, Paul | |
| dc.contributor.author | Spirkl, Sophie | |
| dc.date.accessioned | 2022-08-12 00:55:27 (GMT) | |
| dc.date.available | 2022-08-12 00:55:27 (GMT) | |
| dc.date.issued | 2021-07 | |
| dc.identifier.uri | https://doi.org/10.1016/j.disc.2021.112398 | |
| dc.identifier.uri | http://hdl.handle.net/10012/18523 | |
| dc.description | The final publication is available at Elsevier via https://doi.org/10.1016/j.disc.2021.112398. © 2021. This manuscript version is made available under the CC-BY-NC-ND 4.0 license http://creativecommons.org/licenses/by-nc-nd/4.0/ | en |
| dc.description.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. | en |
| dc.description.sponsorship | Supported by Israel Science Foundation Grant 100004639 and Binational Science Foundation USA–Israel Grant 100005728. Supported by Air Force Office of Scientific Research, United States grant A9550-19-1-0187 and NSF, United States grant DMS-1800053. This material is based upon work supported by the National Science Foundation, United States under Award No. DMS-1802201. | en |
| dc.language.iso | en | en |
| dc.publisher | Elsevier | en |
| dc.rights | Attribution-NonCommercial-NoDerivatives 4.0 International | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
| dc.subject | induced path | en |
| dc.subject | shortest path | en |
| dc.subject | algorithm | en |
| dc.title | Finding an induced path that is not a shortest path | en |
| dc.type | Article | en |
| dcterms.bibliographicCitation | Berger, E., Seymour, P., & Spirkl, S. (2021). Finding an induced path that is not a shortest path. Discrete Mathematics, 344(7), 112398. https://doi.org/10.1016/j.disc.2021.112398 | en |
| uws.contributor.affiliation1 | Faculty of Mathematics | en |
| uws.contributor.affiliation2 | Combinatorics and Optimization | en |
| uws.typeOfResource | Text | en |
| uws.peerReviewStatus | Reviewed | en |
| uws.scholarLevel | Faculty | en |
Files in this item
This item appears in the following Collection(s)
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International