Jump to content

External memory graph traversal: Revision history

View logs for this page (view filter log)

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 19:5519:55, 12 October 2024 JJMC89 bot III talk contribs m 9,663 bytes −10 Moving Category:Algorithms in graph theory to Category:Graph algorithms per Wikipedia:Categories for discussion/Log/2024 October 4 undo Tag: Manual revert
curprev 02:2202:22, 12 October 2024 JJMC89 bot III talk contribs m 9,673 bytes +10 Moving Category:Graph algorithms to Category:Algorithms in graph theory per Wikipedia:Categories for discussion/Log/2024 October 4#Category:Graph algorithms undo Tag: Reverted

curprev 18:1818:18, 12 March 2024 Mazewaxie talk contribs m 9,663 bytes +5 WP:GENFIXES undo Tag: AWB

curprev 08:0108:01, 16 October 2023 Cedar101 talk contribs m 9,658 bytes −21 →Mehlhorn and Meyer: \left \frac \right {{mvar}} undo
curprev 07:5907:59, 16 October 2023 Cedar101 talk contribs 9,679 bytes +116 →External memory depth-first search: <code>, {{tmath}}, ∀ Adding wikilink Assignment (computer science) undo

curprev 03:0703:07, 30 January 2023 OAbot talk contribs m 9,563 bytes +16 Open access bot: doi added to citation with #oabot. undo

curprev 14:1214:12, 25 January 2023 Frap talk contribs 9,547 bytes +46 Add category undo

curprev 18:0318:03, 19 January 2021 Frap talk contribs m 9,501 bytes +8 →External memory depth-first search undo

curprev 15:5515:55, 20 May 2020 YuvanSeth talk contribs m 9,493 bytes +2 In the Munagal and Ranade implementation of BFS, A(t) := N(L(t-1)) is the multi-set of neighbours of level t-1, not t undo

curprev 01:1901:19, 4 November 2019 Elmidae talk contribs 9,491 bytes +123 lede ce undo

curprev 21:1721:17, 7 September 2019 TKOIII talk contribs m 9,368 bytes −1 →Mehlhorn and Meyer: typo undo Tag: Visual edit

curprev 17:4417:44, 2 August 2019 Michael Hardy talk contribs 9,369 bytes +24 DO NOT italicize EVERYTHING in non-TeX math notation. One italicizes variables, but not digits and not punctuation and not things like log, max, det, cos, etc. undo
curprev 17:4217:42, 2 August 2019 Michael Hardy talk contribs 9,345 bytes +53 No edit summary undo
curprev 17:4117:41, 2 August 2019 Michael Hardy talk contribs 9,292 bytes +15 →Mehlhorn and Meyer undo

curprev 23:0623:06, 1 August 2019 Þjarkur talk contribs m 9,277 bytes 0 Þjarkur moved page Draft:External memory graph traversal to External memory graph traversal undo
curprev 23:0623:06, 1 August 2019 Þjarkur talk contribs 9,277 bytes +195 No edit summary undo Tag: Visual edit
curprev 22:5222:52, 1 August 2019 Þjarkur talk contribs m 9,082 bytes −11 Cleaned up a bit undo
curprev 17:1417:14, 1 August 2019 Tgeorge55 talk contribs 9,093 bytes +58 No edit summary undo

curprev 17:1417:14, 31 July 2019 Tgeorge55 talk contribs 9,035 bytes +9,035 ←Created page with 'Graph traversal is a subroutine in most graph algorithms. The goal of a graph traversal algorithm is to visit (and/ or process) every node of...'

Retrieved from "https://en.wikipedia.org/wiki/External_memory_graph_traversal"