FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2771018306> ?p ?o ?g. }

• W2771018306 abstract "Read-only memory model is a classical model of computation to study time-space tradeoffs of algorithms. One of the classical results on the ROM model is that any sorting algorithm that uses O(s) words of extra space requires $Omega (n^2/s)$ comparisons for $ lg n leq s leq n/lg n$ and the bound has also been recently matched by an algorithm. However, if we relax the model (from ROM), we do have sorting algorithms (say Heapsort) that can sort using $O(n lg n)$ comparisons using $O(lg n)$ bits of extra space, even keeping a permutation of the given input sequence at any point of time during the algorithm. We address similar questions for graph algorithms. We show that a simple natural relaxation of ROM model allows us to implement fundamental graph search methods like BFS and DFS more space efficiently than in ROM. By simply allowing elements in the adjacency list of a vertex to be permuted, we show that, on an undirected or directed connected graph $G$ having $n$ vertices and $m$ edges, the vertices of $G$ can be output in a DFS or BFS order using $O(lg n)$ bits of extra space and $O(n^3 lg n)$ time. Thus we obtain similar bounds for reachability and shortest path distance (both for undirected and directed graphs). With a little more (but still polynomial) time, we can also output vertices in the lex-DFS order. As reachability in directed graphs and shortest path distance are NL-complete, and lex-DFS is P-complete, our results show that our model is more powerful than ROM if L $neq$ P. En route, we also introduce and develop algorithms for another relaxation of ROM where the adjacency lists of the vertices are circular lists and we can modify only the heads of the lists. All our algorithms are simple but quite subtle, and we believe that these models are practical enough to spur interest for other graph problems in these models." @default.
• W2771018306 created "2017-12-04" @default.
• W2771018306 creator A5046919162 @default.
• W2771018306 creator A5073311967 @default.
• W2771018306 creator A5079696982 @default.
• W2771018306 creator A5087759069 @default.
• W2771018306 date "2017-11-27" @default.
• W2771018306 modified "2023-10-01" @default.
• W2771018306 title "Frameworks for Designing In-place Graph Algorithms" @default.
• W2771018306 cites W11284402 @default.
• W2771018306 cites W1527197079 @default.
• W2771018306 cites W1828011784 @default.
• W2771018306 cites W1864523757 @default.
• W2771018306 cites W1976463987 @default.
• W2771018306 cites W1982180670 @default.
• W2771018306 cites W1983266860 @default.
• W2771018306 cites W1985953373 @default.
• W2771018306 cites W1990160390 @default.
• W2771018306 cites W1993449345 @default.
• W2771018306 cites W2001552595 @default.
• W2771018306 cites W2011024091 @default.
• W2771018306 cites W2012929520 @default.
• W2771018306 cites W2013967419 @default.
• W2771018306 cites W2014989559 @default.
• W2771018306 cites W2016289973 @default.
• W2771018306 cites W2019136393 @default.
• W2771018306 cites W2027188157 @default.
• W2771018306 cites W2049516232 @default.
• W2771018306 cites W2053984076 @default.
• W2771018306 cites W2064136209 @default.
• W2771018306 cites W2067317911 @default.
• W2771018306 cites W2067431706 @default.
• W2771018306 cites W206903853 @default.
• W2771018306 cites W2080745194 @default.
• W2771018306 cites W2081298180 @default.
• W2771018306 cites W2119468705 @default.
• W2771018306 cites W2128706193 @default.
• W2771018306 cites W2149392423 @default.
• W2771018306 cites W2156305878 @default.
• W2771018306 cites W2156760067 @default.
• W2771018306 cites W2165753192 @default.
• W2771018306 cites W2167049470 @default.
• W2771018306 cites W2169633255 @default.
• W2771018306 cites W2293273465 @default.
• W2771018306 cites W2293337821 @default.
• W2771018306 cites W2337640854 @default.
• W2771018306 cites W2406481306 @default.
• W2771018306 cites W2543489815 @default.
• W2771018306 cites W2765834559 @default.
• W2771018306 cites W2911850790 @default.
• W2771018306 cites W2963123976 @default.
• W2771018306 cites W2963179814 @default.
• W2771018306 cites W3023264955 @default.
• W2771018306 cites W2261777468 @default.
• W2771018306 hasPublicationYear "2017" @default.
• W2771018306 type Work @default.
• W2771018306 sameAs 2771018306 @default.
• W2771018306 citedByCount "1" @default.
• W2771018306 countsByYear W27710183062018 @default.
• W2771018306 crossrefType "posted-content" @default.
• W2771018306 hasAuthorship W2771018306A5046919162 @default.
• W2771018306 hasAuthorship W2771018306A5073311967 @default.
• W2771018306 hasAuthorship W2771018306A5079696982 @default.
• W2771018306 hasAuthorship W2771018306A5087759069 @default.
• W2771018306 hasConcept C110484373 @default.
• W2771018306 hasConcept C11413529 @default.
• W2771018306 hasConcept C114614502 @default.
• W2771018306 hasConcept C118615104 @default.
• W2771018306 hasConcept C132525143 @default.
• W2771018306 hasConcept C136643341 @default.
• W2771018306 hasConcept C146380142 @default.
• W2771018306 hasConcept C22590252 @default.
• W2771018306 hasConcept C311688 @default.
• W2771018306 hasConcept C33923547 @default.
• W2771018306 hasConcept C80899671 @default.
• W2771018306 hasConceptScore W2771018306C110484373 @default.
• W2771018306 hasConceptScore W2771018306C11413529 @default.
• W2771018306 hasConceptScore W2771018306C114614502 @default.
• W2771018306 hasConceptScore W2771018306C118615104 @default.
• W2771018306 hasConceptScore W2771018306C132525143 @default.
• W2771018306 hasConceptScore W2771018306C136643341 @default.
• W2771018306 hasConceptScore W2771018306C146380142 @default.
• W2771018306 hasConceptScore W2771018306C22590252 @default.
• W2771018306 hasConceptScore W2771018306C311688 @default.
• W2771018306 hasConceptScore W2771018306C33923547 @default.
• W2771018306 hasConceptScore W2771018306C80899671 @default.
• W2771018306 hasLocation W27710183061 @default.
• W2771018306 hasOpenAccess W2771018306 @default.
• W2771018306 hasPrimaryLocation W27710183061 @default.
• W2771018306 hasRelatedWork W1537954077 @default.
• W2771018306 hasRelatedWork W1538365848 @default.
• W2771018306 hasRelatedWork W1596674180 @default.
• W2771018306 hasRelatedWork W2044334960 @default.
• W2771018306 hasRelatedWork W2278152522 @default.
• W2771018306 hasRelatedWork W2395495808 @default.
• W2771018306 hasRelatedWork W2406775514 @default.
• W2771018306 hasRelatedWork W2526595197 @default.
• W2771018306 hasRelatedWork W2596737675 @default.
• W2771018306 hasRelatedWork W2802632688 @default.
• W2771018306 hasRelatedWork W2889523050 @default.

• next