Parallel algorithms for maximum matching in complements of interval graphs and related problems

DOI10.1007/S004539910013MaRDI QIDQ1969958zbMATH OpenOpenAlexFDO

Authors Yanyan Li, M. G. Andrews, Mikhail J. Atallah, Danny Z. Chen, Der-Tsai Lee

Publication date 19 March 2000

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://docs.lib.purdue.edu/cstech/1421, https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=2420&context=cstech

zbMATH Keywords

maximum matching

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Recommendations

• Parallel maximum matching algorithms in interval graphs
• scientific article; zbMATH DE number 3892606
• An optimal parallel algorithm for maximal matching
• scientific article; zbMATH DE number 123468
• Parallel algorithms for connectivity problems on interval graphs

Cited in

(8)

• Mutual exclusion scheduling with interval graphs or related classes. I
• scientific article; zbMATH DE number 3965452 (Why is no real title available?)
• Efficient algorithms for disjoint matchings among intervals and related problems
• Maximum red/blue interval matching with applications
• ON CONNECTING RED AND BLUE RECTILINEAR POLYGONAL OBSTACLES WITH NONINTERSECTING MONOTONE RECTILINEAR PATHS
• Parallel maximum matching algorithms in interval graphs
• Recognizing and representing proper interval graphs in parallel using merging and sorting
• Capacitated max-batching with interval graph compatibilities

This page was built for publication: Parallel algorithms for maximum matching in complements of interval graphs and related problems

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