Generating the maximum spanning trees of a weighted graph
From MaRDI portal
Publication:3776656
DOI10.1016/0196-6774(87)90053-8zbMath0636.68091OpenAlexW1983186008MaRDI QIDQ3776656
Publication date: 1987
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0196-6774(87)90053-8
polynomial time algorithmweighted graphefficient algorithmacyclic hypergraphtree representationsmaximum spanning trees
Analysis of algorithms and problem complexity (68Q25) Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Software, source code, etc. for problems pertaining to combinatorics (05-04)
Related Items (9)
Clique tree generalization and new subclasses of chordal graphs ⋮ Intersection graphs of Helly families of subtrees ⋮ Minimum Average Distance Clique Trees ⋮ Reduced clique graphs of chordal graphs ⋮ The vertex leafage of chordal graphs ⋮ Characterization of classical graph classes by weighted clique graphs ⋮ An efficient representation of chordal graphs ⋮ Intersection representations of matrices by subtrees and unicycles on graphs ⋮ Intersection graphs of \(k\)-acyclic families of subtrees and relational database query processing.
This page was built for publication: Generating the maximum spanning trees of a weighted graph
