scientific article; zbMATH DE number 2040948

zbMATH Open1038.68148MaRDI QIDQ4452099FDOQ4452099

Frédéric Gardi

Publication date: 11 February 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2731/27310168.htm

Title of this publication is not available (Why is that?)

Recommendations

• Parameterized and approximation algorithms for finding two disjoint matchings
• Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings
• Parallel algorithms for maximum matching in complements of interval graphs and related problems
• Disjoint stable matchings in linear time
• Parallel maximum matching algorithms in interval graphs
• scientific article; zbMATH DE number 19225
• An efficient algorithm for the bipartite matching problem
• Sublinear-Time Parallel Algorithms for Matching and Related Problems
• Efficient algorithms for a family of matroid intersection problems
• scientific article; zbMATH DE number 1305400

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05)

Cited In (5)

• Mutual exclusion scheduling with interval graphs or related classes. I
• A Linear-Time Algorithm for Maximum-Cardinality Matching on Cocomparability Graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Parameterized and Approximation Algorithms for Finding Two Disjoint Matchings

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 Q4452099)