PARALLEL MAXIMUM MATCHING ALGORITHMS IN INTERVAL GRAPHS

DOI10.1142/S0129054199000058zbMath1319.68244MaRDI QIDQ5248991

Yoojin Chung, Yookin Cho, Kun Soo Park

Publication date: 29 April 2015

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

parallel algorithmsmaximum matchingPRAMinterval graphs

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Parallel algorithms in computer science (68W10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

An efficient parallel algorithm for scheduling interval ordered tasks

Cites Work

• Optimal scheduling for two-processor systems
• Efficient algorithms for finding maximum matching in graphs
• Two Processor Scheduling is in $\mathcal{NC}$
• An Almost-Linear Algorithm for Two-Processor Scheduling

This page was built for publication: PARALLEL MAXIMUM MATCHING ALGORITHMS IN INTERVAL GRAPHS