NC algorithms for recognizing chordal graphs and k trees

DOI10.1109/12.5979MaRDI QIDQ3806839zbMATH OpenOpenAlexFDO

Authors N. Chandrasekharan, S. S. Iyengar

Publication date 1988

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/2278ebad0cc0e3f9fd96d277903ce2c5e53c3c1b

zbMATH Keywords

chordal graphsNC algorithmparallel algorithmstrees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Parallel recognition algorithms for chordal-planar graphs and planar k-trees
• Fast Parallel Algorithms for Chordal Graphs
• Efficient Parallel Algorithms for Chordal Graphs
• Fast parallel reordering and isomorphism testing of \(k\)-trees
• NC Algorithms for Recognizing Partial 2-Trees and 3-Trees

Cited in

(14)

• Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
• Complexity of some graph-based bounds on the probability of a union of events
• Parallel recognition algorithms for chordal-planar graphs and planar k-trees
• NC Algorithms for Recognizing Partial 2-Trees and 3-Trees
• Fast Parallel Algorithms for Chordal Graphs
• An nc algorithm to recognize hhd-free graphs
• scientific article; zbMATH DE number 1533813 (Why is no real title available?)
• Efficient Parallel Algorithms for Chordal Graphs
• Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs
• The impact of locality in the broadcast congested clique model
• The Space Complexity of k-Tree Isomorphism
• Minimal triangulations of graphs: a survey
• A fast parallel algorithm to recognize partitionable graphs
• On the complexity of some subgraph problems

This page was built for publication: NC algorithms for recognizing chordal graphs and k trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3806839)