scientific article; zbMATH DE number 1151367

MaRDI QIDQ4389326zbMATH OpenFDO

Authors Marek Karpinski, Wojciech Rytter

Publication date 13 May 1998

zbMATH Keywords

graph matchingparallel algorithmsplanar graphssequential algorithms

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 107950
• scientific article; zbMATH DE number 3905859
• Efficient algorithms for finding maximum matching in graphs
• scientific article; zbMATH DE number 1163093

Cited in

(21)

• Improved processor bounds for combinatorial problems in RNC
• Guide to graph algorithms. Sequential, parallel and distributed
• Parallel algorithms for flexible pattern matching on big graphs
• On graph problems in a semi-streaming model
• Parallel graph algorithms for finding weighted matchings and subgraphs in computational science
• Parallel approximation algorithms for maximum weighted matching in general graphs
• Parallel graduated assignment algorithm for multiple graph matching based on a common labelling
• scientific article; zbMATH DE number 4068310 (Why is no real title available?)
• Perfect Matching in General vs. Cubic Graphs: A Note on the Planar and Bipartite Cases
• scientific article; zbMATH DE number 1759463 (Why is no real title available?)
• Bipartite perfect matching is in quasi-NC
• Counting shortest two disjoint paths in cubic planar graphs with an NC algorithm
• Planar Maximum Matching: Towards a Parallel Algorithm
• Faster Combinatorial Algorithms for Determinant and Pfaffian
• Ridesharing for emergency evacuation
• Efficient matching in large DAE models
• Parameterized algorithms for diversity of networks with ecological dependencies
• Approximating weighted matchings in parallel
• Faster combinatorial algorithms for determinant and Pfaffian
• Simultaneous matchings: Hardness and approximation
• Fast profile matching algorithms - A survey

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4389326)