scientific article
From MaRDI portal
Publication:2969611
DOI10.4230/LIPIcs.APPROX-RANDOM.2014.96zbMath1359.68306MaRDI QIDQ2969611
Michael S. Crouch, Daniel M. Stubbs
Publication date: 22 March 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Approximation algorithms (68W25)
Related Items (12)
Sublinear Estimation of Weighted Matchings in Dynamic Data Streams ⋮ Maximum Matching in Turnstile Streams ⋮ Maximum matching sans maximal matching: a new approach for finding maximum matchings in the data stream model ⋮ Unnamed Item ⋮ Improved bounds for randomized preemptive online matching ⋮ Maximum Matching in Two, Three, and a Few More Passes Over Graph Streams ⋮ Succinct summing over sliding windows ⋮ Structural results on matching estimation with applications to streaming ⋮ Semi-streaming algorithms for submodular matroid intersection ⋮ Semi-streaming algorithms for submodular matroid intersection ⋮ The sparse awakens: Streaming algorithms for matching size estimation in sparse graphs ⋮ Unnamed Item
This page was built for publication:
