Parallel graph algorithms for finding weighted matchings and subgraphs in computational science

zbMATH Open1348.05001MaRDI QIDQ2830821

Madan Sathe

Publication date: 31 October 2016

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Nonnumerical algorithms (68W05) Graph algorithms (graph-theoretic aspects) (05C85) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (2)

Parallel algorithms for flexible pattern matching on big graphs ⋮ Sequential and parallel solution-biased search for subgraph algorithms

Recommendations

• Parallel approximation algorithms for maximum weighted matching in general graphs 👍 👎
• Approximating weighted matchings in parallel 👍 👎
• An efficient parallel algorithm for maximum matching for some classes of graphs 👍 👎
• An optimal parallel matching algorithm for cographs 👍 👎
• Efficient Parallel Algorithms for a Class of Graph Theoretic Problems 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎

This page was built for publication: Parallel graph algorithms for finding weighted matchings and subgraphs in computational science

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