Parallel algorithms on circular-arc graphs

DOI10.1016/0925-7721(94)00024-PzbMath0839.68036MaRDI QIDQ5917729

No author found.

Publication date: 12 December 1995

Published in: Computational Geometry (Search for Journal in Brave)

zbMATH Keywords

EREW-PRAM modelparallel-algorithm

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• A new approach for the domination problem on permutation graphs
• On a circle-cover minimization problem
• An optimal parallel algorithm for the minimum circle-cover problem
• Optimal parallel algorithms on circular-arc graphs
• Minimum Cuts for Circular-Arc Graphs
• An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph

This page was built for publication: Parallel algorithms on circular-arc graphs