A fast parallel algorithm to recognize partitionable graphs

DOI10.1016/0020-0190(90)90085-CzbMath0704.68047OpenAlexW1980804329MaRDI QIDQ917295

Elsie Sterbin Gottlieb

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90085-c

zbMATH Keywords

NC algorithmsbrittle graphsEREW parallel random access machine

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topics on perfect graphs
• A note on superbrittle graphs
• Weak bipolarizable graphs
• A New Class of Brittle Graphs
• A Linear Recognition Algorithm for Cographs
• Four classes of perfectly orderable graphs
• NC algorithms for recognizing chordal graphs and k trees

This page was built for publication: A fast parallel algorithm to recognize partitionable graphs