scientific article; zbMATH DE number 1533813
From MaRDI portal
Publication:4517025
A local algorithm is presented for the verification of the chordality of a graph within a model of graph-rewriting systems with priority. A prototype of this algorithm is the algorithm of Tarjan and Yannakakis called the algorithm of maximum cardinality search. For the entire collection see [Zbl 0944.00028].
Recommendations
- NC algorithms for recognizing chordal graphs and k trees
- On the recognition of families of graphs with local computations
- Efficient Parallel Algorithms for Chordal Graphs
- Characterizations of classes of graphs recognizable by local computations
- Graph relabelling systems: a tool for encoding, proving, studying and visualizing distributed algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4517025)