scientific article; zbMATH DE number 1151367
From MaRDI portal
Publication:4389326
zbMath0895.05050MaRDI QIDQ4389326
Wojciech Rytter, Marek Karpinski
Publication date: 13 May 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph algorithms (graph-theoretic aspects) (05C85) Distributed algorithms (68W15)
Related Items (12)
Ridesharing for emergency evacuation ⋮ Parallel approximation algorithms for maximum weighted matching in general graphs ⋮ Approximating weighted matchings in parallel ⋮ Faster combinatorial algorithms for determinant and Pfaffian ⋮ Faster Combinatorial Algorithms for Determinant and Pfaffian ⋮ Simultaneous matchings: Hardness and approximation ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Planar Maximum Matching: Towards a Parallel Algorithm ⋮ Bipartite Perfect Matching is in Quasi-NC ⋮ On graph problems in a semi-streaming model ⋮ Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases
This page was built for publication:
