Constructing long paths in graph streams
From MaRDI portal
Cites work
- A streaming algorithm for the undirected longest path problem
- A two-pass (conditional) lower bound for semi-streaming maximum matching
- An unconditional lower bound for two-pass streaming algorithms for maximum matching approximation
- Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques
- Automata, Languages and Programming
- Communication Complexity
- Correlation clustering in data streams
- Depth First Search in the Semi-streaming Model
- scientific article; zbMATH DE number 7053293 (Why is no real title available?)
- scientific article; zbMATH DE number 7650919 (Why is no real title available?)
- scientific article; zbMATH DE number 7768364 (Why is no real title available?)
- Independent sets in vertex-arrival streams
- Maximum matching via maximal matching queries
- Maximum matchings in dynamic graph streams and the simultaneous communication model
- Monotonicity testing over general poset domains
- Narrow sieves for parameterized paths and packings
- Nearly complete graphs decomposable into large induced matchings and their applications
- On approximating the longest path in a graph
- On estimating maximum matching size in graph streams
- On graph problems in a semi-streaming model
- Optimal lower bounds for matching and vertex cover in dynamic graph streams
- Random sampling with a reservoir
- Settling the pass complexity of approximate matchings in dynamic graph streams
- Streaming and communication complexity of load-balancing via matching contractors
- Sublinear algorithms for ( + 1) vertex coloring
- Vertex Ordering Problems in Directed Graph Streams
This page was built for publication: Constructing long paths in graph streams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7322410)
