Amortized efficiency of a path retrieval data structure (Q1099629): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(86)90098-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1976177462 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q61609681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Representation of Directed Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of pushdown automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: An On-Line Edge-Deletion Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line computation of transitive closures of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamically switching vertices in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3685214 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Amortized Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case Analysis of Set Union Algorithms / rank
 
Normal rank

Latest revision as of 16:18, 18 June 2024

scientific article
Language Label Description Also known as
English
Amortized efficiency of a path retrieval data structure
scientific article

    Statements