Minimum average distance clique trees
DOI10.1137/15M1021052zbMATH Open1337.68213OpenAlexW1933633022MaRDI QIDQ2947438FDOQ2947438
Authors: S. J. Xu, Rob Gysel, 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
Recommendations
Problems related to evolution (92D15) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distance in graphs (05C12)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Modeling and Reasoning with Bayesian Networks
- The complexity of reconstructing trees from qualitative characters and subtrees
- Wiener index of hexagonal systems
- Algorithmic graph theory and perfect graphs
- Incidence matrices and interval graphs
- Wiener index of trees: Theory and applications
- On rigid circuit graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Representations of chordal graphs as subtrees of a tree
- Distance in graphs
- Title not available (Why is that?)
- Triangulated graphs and the elimination process
- The leafage of a chordal graph
- The complexity of the network design problem
- Identifying phylogenetic trees
- Title not available (Why is that?)
- Counting clique trees and computing perfect elimination schemes in parallel
- Power of Natural Semijoins
- A characterisation of rigid circuit graphs
- A simple algorithm to generate the minimal separators and the maximal cliques of a chordal graph
- Generating the maximum spanning trees of a weighted graph
- A wide-range algorithm for minimal triangulation from an arbitrary ordering
- Creating non-minimal triangulations for use in inference in mixed stochastic/deterministic graphical models
- Generalizing the splits equivalence theorem and four gamete condition: Perfect phylogeny on three-state characters
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
- A characterization for a set of partial partitions to define an \(X\)-tree
- Efficient parallel algorithms for finding maximal cliques, clique trees, and minimum coloring on chordal graphs
- Rank inequalities for chordal graphs
Cited In (5)
This page was built for publication: Minimum average distance clique trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2947438)
