Minimum Average Distance Clique Trees
From MaRDI portal
Publication:2947438
DOI10.1137/15M1021052zbMath1337.68213OpenAlexW1933633022MaRDI QIDQ2947438
Rob Gysel, Shou-Jun Xu, Dan Gusfield
Publication date: 23 September 2015
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m1021052
Problems related to evolution (92D15) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (3)
A survey of the all-pairs shortest paths problem and its variants in graphs ⋮ Moplex orderings generated by the LexDFs algorithm ⋮ On the maximum value of the eccentric distance sums of cubic transitive graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
- On rigid circuit graphs
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
- The complexity of reconstructing trees from qualitative characters and subtrees
- Counting clique trees and computing perfect elimination schemes in parallel
- A characterization for a set of partial partitions to define an \(X\)-tree
- Wiener index of hexagonal systems
- A characterisation of rigid circuit graphs
- Algorithmic graph theory and perfect graphs
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
- Rank inequalities for chordal graphs
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
- Incidence matrices and interval graphs
- Triangulated graphs and the elimination process
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Identifying phylogenetic trees
- Generalizing the Splits Equivalence Theorem and Four Gamete Condition: Perfect Phylogeny on Three-State Characters
- Modeling and Reasoning with Bayesian Networks
- Generating the maximum spanning trees of a weighted graph
- Representations of chordal graphs as subtrees of a tree
- Power of Natural Semijoins
- Distance in graphs
- The complexity of the network design problem
- The leafage of a chordal graph
- A wide-range algorithm for minimal triangulation from an arbitrary ordering
- Wiener index of trees: Theory and applications
This page was built for publication: Minimum Average Distance Clique Trees
