An optimal parallel algorithm for node ranking of cographs

DOI10.1016/S0166-218X(98)00056-0zbMath0906.68087OpenAlexW1977068029MaRDI QIDQ1270781

Ming-Shing Yu, Chuan-Ming Liu

Publication date: 3 November 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

ranking

Mathematics Subject Classification ID

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

Related Items (3)

A faster parallel connectivity algorithm on cographs ⋮ On parallel recognition of cographs ⋮ Rank numbers of grid graphs

Cites Work

• Optimal node ranking of trees
• Complement reducible graphs
• On a graph partition problem with application to VLSI layout
• Optimal node ranking of tree in linear time
• The Role of Elimination Trees in Sparse Factorization
• The Multifrontal Solution of Indefinite Sparse Symmetric Linear
• Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
• The Pathwidth and Treewidth of Cographs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An optimal parallel algorithm for node ranking of cographs