Dynamic DFS in Undirected Graphs: breaking the O(<i>m</i>) barrier (Q4575631): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1137/1.9781611974331.ch52 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1721652159 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1502.02481 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1137/1.9781611974331.CH52 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:06, 30 December 2024

scientific article; zbMATH DE number 6903929
Language Label Description Also known as
English
Dynamic DFS in Undirected Graphs: breaking the O(<i>m</i>) barrier
scientific article; zbMATH DE number 6903929

    Statements

    Dynamic DFS in Undirected Graphs: breaking the O(<i>m</i>) barrier (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 July 2018
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references