scientific article; zbMATH DE number 751126
From MaRDI portal
Publication:4764622
zbMATH Open0819.68085MaRDI QIDQ4764622FDOQ4764622
Authors: Jean R. S. Blair, Barry W. Peyton 
Publication date: 4 May 1995
Title of this publication is not available (Why is that?)
Recommendations
- Minimum average distance clique trees
- scientific article; zbMATH DE number 554762
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs
- Counting clique trees and computing perfect elimination schemes in parallel
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cited In (12)
- Minimum weight clustered dominating tree problem
- Efficient parallel algorithm to compute a doubly perfect elimination ordering of a doubly chordal graph
- End simplicial vertices in path graphs
- Subgraph trees in graph theory
- Minimizing diameters of dynamic trees
- Title not available (Why is that?)
- Minimum average distance clique trees
- Finding minimum height elimination trees for interval graphs in polynomial time
- Moplex orderings generated by the LexDFs algorithm
- A clique tree algorithm for partitioning a chordal graph into transitive subgraphs
- Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs
- Tree-decompositions with bags of small diameter
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 Q4764622)
