Depth First Search in the Semi-streaming Model (Q5090492): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
label / enlabel / en
 
Depth First Search in the Semi-streaming Model
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming in the semi-streaming model with application to the maximum matching problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The space complexity of approximating the frequency moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming algorithm for graph spanners-single pass and constant processing time per edge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic DFS in Undirected Graphs: breaking the O(<i>m</i>) barrier / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental algorithm for maintaining a DFS tree for undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding common neighborhoods in massive graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed exact shortest paths in sublinear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Flow and Testing Graph Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Articulation Points of Large Graphs in Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graph problems in a semi-streaming model / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximate <i>L</i><sup>1</sup> -Difference Algorithm for Massive Data Streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic counting algorithms for data base applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data-streams and histograms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Superlinear lower bounds for multipass graph processing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4945538 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Planarity Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable distributions, pseudorandom generators, embeddings, and data stream computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Better bounds for matchings in the streaming model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425115 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Graph Algorithms Under Extended Streaming Models of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Dominators in Directed Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of a Good But Not Linear Set Union Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-disjoint spanning trees and depth-first search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case Analysis of Set Union Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining bridge-connected and biconnected components on-line / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963850880 / rank
 
Normal rank
Property / title
 
Depth First Search in the Semi-streaming Model (English)
Property / title: Depth First Search in the Semi-streaming Model (English) / rank
 
Normal rank

Latest revision as of 10:04, 30 July 2024

scientific article; zbMATH DE number 7559151
Language Label Description Also known as
English
Depth First Search in the Semi-streaming Model
scientific article; zbMATH DE number 7559151

    Statements

    0 references
    0 references
    18 July 2022
    0 references
    depth first search
    0 references
    DFS
    0 references
    semi-streaming
    0 references
    streaming
    0 references
    algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    Depth First Search in the Semi-streaming Model (English)
    0 references

    Identifiers