Longest path problem: Revision history

Filter revisionsshowhide

To date:

Tag filter:

Invert selection

External tools:

For any version listed below, click on its date to view it. For more help, see Help:Page history and Help:Edit summary. (cur) = difference from current version, (prev) = difference from preceding version, m = minor edit, → = section edit, ← = automatic edit summary

curprev 01:5901:59, 2 January 2024‎ Rhoegg talk contribs‎ m 22,504 bytes −18‎ broken link undo

curprev 20:1720:17, 24 December 2023‎ David Eppstein talk contribs‎ 22,522 bytes +8‎ Undid revision 1191610075 by Kirelagin (talk) membership in NP is trivial for both undo Tag: Undo
curprev 15:4215:42, 24 December 2023‎ Kirelagin talk contribs‎ 22,514 bytes −8‎ Reductions show hardness, not completeness undo Tags: Reverted 2017 wikitext editor

curprev 23:0423:04, 3 September 2023‎ David Eppstein talk contribs‎ 22,522 bytes +205‎ Undid revision 1173689550 by Citation bot (talk) disimprovement undo
curprev 22:0022:00, 3 September 2023‎ Citation bot talk contribs‎ 22,317 bytes +40‎ Alter: title. Add: chapter. | Use this bot. Report bugs. | Suggested by Abductive | Category:Graph distance | #UCB_Category 6/15 undo

curprev 03:2403:24, 31 August 2023‎ Catttte talk contribs‎ m 22,277 bytes +56‎ →‎Special classes of graphs: link to E.W. Dijkstra & 'tree' undo Tag: 2017 wikitext editor

curprev 12:3512:35, 13 August 2023‎ OAbot talk contribs‎ m 22,221 bytes +21‎ Open access bot: doi added to citation with #oabot. undo

curprev 22:0722:07, 2 March 2023‎ Yoshi24517 talk contribs‎ m 22,200 bytes +8,811‎ Reverted edits by 184.180.128.226 (talk) (HG) (3.4.12) undo Tag: Rollback
curprev 22:0722:07, 2 March 2023‎ 184.180.128.226 talk‎ 13,389 bytes −8,811‎ I changed this because you do not explain well enough undo Tags: Reverted possible vandalism

curprev 16:0816:08, 20 October 2022‎ Gleb713 talk contribs‎ 22,200 bytes +6‎ Acronyms are best introduced explicitly. undo

curprev 06:5106:51, 8 September 2022‎ Boqvezen97 talk contribs‎ m 22,194 bytes +2‎ →‎NP-hardness: quote mark correction undo

curprev 22:1222:12, 21 June 2022‎ OlliverWithDoubleL talk contribs‎ 22,192 bytes +132‎ short description, links undo Tags: Mobile edit Mobile app edit iOS app edit

curprev 05:4605:46, 6 July 2021‎ David Eppstein talk contribs‎ 22,060 bytes +69‎ Harold N. Gabow undo

curprev 12:1612:16, 5 January 2021‎ LaundryPizza03 talk contribs‎ 21,717 bytes +28‎ added Category:Graph distance using HotCat undo

curprev 15:0715:07, 6 November 2020‎ Playerwithgraphs talk contribs‎ m 21,689 bytes +109‎ →‎See also undo
curprev 15:0315:03, 6 November 2020‎ Playerwithgraphs talk contribs‎ m 21,580 bytes +4‎ →‎Special classes of graphs undo
curprev 15:0215:02, 6 November 2020‎ Playerwithgraphs talk contribs‎ 21,576 bytes +762‎ →‎Special classes of graphs undo

curprev 02:3902:39, 1 September 2020‎ Citation bot talk contribs‎ 20,814 bytes +173‎ Add: url, s2cid. | You can use this bot yourself. Report bugs here. | Suggested by SemperIocundus | via #UCB_webform undo

curprev 01:1801:18, 19 May 2020‎ Rich Farmbrough talk contribs‎ 20,641 bytes 0‎ →‎Special classes of graphs undo

curprev 13:5613:56, 13 April 2020‎ OAbot talk contribs‎ m 20,641 bytes +21‎ Open access bot: doi added to citation with #oabot. undo

curprev 21:1621:16, 17 March 2020‎ InternetArchiveBot talk contribs‎ 20,620 bytes +408‎ Rescuing 2 sources and tagging 0 as dead.) #IABot (v2.0 undo

curprev 12:1512:15, 20 July 2019‎ Nemo bis talk contribs‎ 20,212 bytes −228‎ Removed URL that duplicated unique identifier. | You can use this tool yourself. Report bugs here. undo

curprev 19:1219:12, 10 July 2019‎ Nmndlr talk contribs‎ m 20,440 bytes +42‎ →‎Special classes of graphs: hyperlinks to bipartite and permutation graph undo
curprev 19:0919:09, 10 July 2019‎ Nmndlr talk contribs‎ 20,398 bytes +33‎ →‎Special classes of graphs: Add hyperlinks to block and cactus graphs undo

curprev 13:4013:40, 2 May 2019‎ 134.126.96.203 talk‎ 20,365 bytes +142‎ No edit summary undo

curprev 08:4508:45, 14 March 2019‎ Citation bot talk contribs‎ m 20,223 bytes +49‎ Add: doi, issue. | You can use this bot yourself. Report bugs here. | User-activated. undo

curprev 14:3214:32, 15 February 2019‎ Neypot talk contribs‎ 20,174 bytes +4‎ NP-hardness does not imply that it can be solved in polynomial time if P = NP. NP-completeness implies that fact. undo

curprev 04:1904:19, 27 January 2019‎ Citation bot talk contribs‎ m 20,170 bytes +173‎ Alter: url, journal. Add: pages, series, doi, volume, citeseerx, url, isbn. Removed parameters. Formatted dashes. | You can use this bot yourself. Report bugs here. | User-activated. undo

curprev 12:5012:50, 20 August 2018‎ David Eppstein talk contribs‎ 19,997 bytes −658‎ Undid revision 855706343 by Joostvanpinxten (talk) wording not improved. In particular why non-negative for DAGS? And why the repeated verb in "Finding longest paths in directed graphs that may contain cycles can be found"? undo Tag: Undo
curprev 08:0608:06, 20 August 2018‎ Joostvanpinxten talk contribs‎ 20,655 bytes +658‎ Emphasize that the difference in complexity between shortest path and longest path is due to the restriction on simple paths. Add information on finding longest (non-simple) paths in directed graphs that may contain cycles. undo Tag: Visual edit

curprev 20:0620:06, 30 July 2018‎ 79.88.76.95 talk‎ 19,997 bytes +4‎ Added a reference to ptolemaic graphs undo

curprev 12:5712:57, 16 May 2018‎ OAbot talk contribs‎ m 19,993 bytes +21‎ Open access bot: add arxiv identifier to citation with #oabot. undo

curprev 02:3502:35, 23 December 2017‎ 129.234.250.154 talk‎ 19,972 bytes +1‎ →‎Special classes of graphs undo
curprev 02:3202:32, 23 December 2017‎ 129.234.250.154 talk‎ 19,971 bytes +3,251‎ →‎Special classes of graphs undo

curprev 12:0812:08, 1 December 2017‎ KarlFrei talk contribs‎ 16,720 bytes +44‎ →‎NP-hardness: Correct but misleading statement replaced. Source is the same as before. undo

curprev 15:5215:52, 3 August 2017‎ David Eppstein talk contribs‎ 16,676 bytes +9‎ Undid revision 793727584 by Btwied (talk) membership in NP is trivial undo
curprev 15:2915:29, 3 August 2017‎ Btwied talk contribs‎ m 16,667 bytes −9‎ The reduction proves NP-hardness; showing NP-completeness requires an efficient verifier (showing the problem to be in NP). undo

curprev 00:4500:45, 6 July 2017‎ David Eppstein talk contribs‎ m 16,676 bytes +27‎ Uri Zwick undo

curprev 12:4312:43, 22 October 2016‎ Bender the Bot talk contribs‎ m 16,649 bytes +4‎ http→https for Google Books and Google News using AWB undo

curprev 01:2901:29, 25 June 2016‎ 67.141.87.141 talk‎ 16,645 bytes +44‎ →‎Approximation: Fix bad linebreak opportunity undo

curprev 16:3316:33, 10 August 2015‎ Solomon7968 talk contribs‎ m 16,601 bytes −19‎ link Lecture Notes in Computer Science using Find link; formatting: 5x HTML entity, heading-style, whitespace (using Advisor.js) undo

curprev 07:0907:09, 15 July 2015‎ Head talk contribs‎ 16,620 bytes +1‎ Clarified singular/plural. Each longest path can be found in O(n), but to find all longest paths you need O(n²). undo

curprev 04:0004:00, 1 May 2015‎ 89.173.49.152 talk‎ 16,619 bytes +5‎ →‎NP-hardness undo

curprev 08:3508:35, 29 April 2015‎ 2601:9:900:6db:bc11:631d:e98f:1976 talk‎ 16,614 bytes +2‎ →‎Approximation undo

curprev 08:2608:26, 5 March 2015‎ David Eppstein talk contribs‎ m 16,612 bytes +1‎ →‎Approximation: fix harv ref undo

2 January 2024

24 December 2023

3 September 2023

31 August 2023

13 August 2023

2 March 2023

20 October 2022

8 September 2022

21 June 2022

6 July 2021

21 April 2021

5 January 2021

6 November 2020

1 September 2020

19 May 2020

13 April 2020

17 March 2020

20 July 2019

10 July 2019

2 May 2019

14 March 2019

15 February 2019

27 January 2019

20 August 2018

30 July 2018

16 May 2018

23 December 2017

1 December 2017

3 August 2017

6 July 2017

22 October 2016

25 June 2016

10 August 2015

15 July 2015

1 May 2015

29 April 2015

5 March 2015