Efficient Parallel Algorithms for Chordal Graphs
From MaRDI portal
Publication:4895831
DOI10.1137/S0097539789166880zbMath0857.68049MaRDI QIDQ4895831
Publication date: 16 October 1996
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10) Distributed algorithms (68W15)
Related Items (9)
I/O-efficient algorithms for graphs of bounded treewidth ⋮ The QAP-polytope and the graph isomorphism problem ⋮ Recognizing and representing proper interval graphs in parallel using merging and sorting ⋮ Counting the number of independent sets in chordal graphs ⋮ Interval graph representation with given interval and intersection lengths ⋮ A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs ⋮ Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search ⋮ Laminar structure of ptolemaic graphs with applications ⋮ Biconvex graphs: Ordering and algorithms
This page was built for publication: Efficient Parallel Algorithms for Chordal Graphs
