NC algorithms for recognizing chordal graphs and k trees
From MaRDI portal
Publication:3806839
DOI10.1109/12.5979zbMath0658.68080MaRDI QIDQ3806839
N. Chandrasekharan, S. Sitharama 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
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
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, Complexity of some graph-based bounds on the probability of a union of events, An nc algorithm to recognize hhd-free graphs