Pages that link to "Item:Q2581265"
From MaRDI portal
The following pages link to On graph problems in a semi-streaming model (Q2581265):
Displayed 50 items.
- Streaming algorithms for independent sets in sparse hypergraphs (Q329293) (← links)
- Superlinear lower bounds for multipass graph processing (Q343847) (← links)
- Drawing trees in a streaming model (Q436551) (← links)
- Data mining of social networks represented as graphs (Q465703) (← links)
- Best-order streaming model (Q534570) (← links)
- Submodular maximization meets streaming: matchings, matroids, and more (Q896286) (← links)
- Interval selection in the streaming model (Q1676325) (← links)
- Improved bounds for randomized preemptive online matching (Q1706142) (← links)
- On extensions of the deterministic online model for bipartite matching and max-sat (Q1740687) (← links)
- Dynamic graph stream algorithms in \(o(n)\) space (Q1741857) (← links)
- Structural results on matching estimation with applications to streaming (Q1755797) (← links)
- Streaming graph computations with a helpful advisor (Q1939657) (← links)
- Graph spanners: a tutorial review (Q2026289) (← links)
- Correlation clustering in data streams (Q2037102) (← links)
- Almost-smooth histograms and sliding-window graph algorithms (Q2088588) (← links)
- Linear-time parameterized algorithms with limited local resources (Q2105436) (← links)
- Streaming deletion problems parameterized by vertex cover (Q2140522) (← links)
- Frameworks for designing in-place graph algorithms (Q2237887) (← links)
- Maximum matching on trees in the online preemptive and the incremental graph models (Q2329370) (← links)
- A linear time deterministic algorithm to find a small subset that approximates the centroid (Q2380033) (← links)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
- Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components (Q2894245) (← links)
- Single Pass Spectral Sparsification in Dynamic Streams (Q2968162) (← links)
- Buyback Problem - Approximate Matroid Intersection with Cancellation Costs (Q3012820) (← links)
- Linear Programming in the Semi-streaming Model with Application to the Maximum Matching Problem (Q3012945) (← links)
- Streaming Algorithms for Submodular Function Maximization (Q3448795) (← links)
- Finding Articulation Points of Large Graphs in Linear Time (Q3449834) (← links)
- Sublinear Estimation of Weighted Matchings in Dynamic Data Streams (Q3452791) (← links)
- On Randomized Algorithms for Matching in the Online Preemptive Model (Q3452797) (← links)
- Maximum Matching in Turnstile Streams (Q3452845) (← links)
- Dynamic Approximate Vertex Cover and Maximum Matching (Q4933386) (← links)
- Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models (Q4989920) (← links)
- Tight Bounds for Single-Pass Streaming Complexity of the Set Cover Problem (Q4997308) (← links)
- A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths (Q4997313) (← links)
- Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams (Q5002618) (← links)
- A simple augmentation method for matchings with applications to streaming algorithms (Q5005178) (← links)
- A Framework for In-place Graph Algorithms (Q5009570) (← links)
- Optimal In-place Algorithms for Basic Graph Problems (Q5041185) (← links)
- Depth First Search in the Semi-streaming Model (Q5090492) (← links)
- (Q5090980) (← links)
- When Algorithms for Maximal Independent Set and Maximal Matching Run in Sublinear Time (Q5091165) (← links)
- The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs (Q5111716) (← links)
- (Q5743413) (← links)
- (Q5743414) (← links)
- On conceptually simple algorithms for variants of online bipartite matching (Q5915658) (← links)
- Semi-streaming algorithms for submodular matroid intersection (Q5918428) (← links)
- Relaxing the irrevocability requirement for online graph algorithms (Q5918715) (← links)
- Semi-streaming algorithms for submodular matroid intersection (Q5925648) (← links)
- Streaming deletion problems Parameterized by vertex cover (Q6057830) (← links)
- Distributed Testing of Graph Isomorphism in the CONGEST Model. (Q6084362) (← links)