Generating the maximum spanning trees of a weighted graph

DOI10.1016/0196-6774(87)90053-8MaRDI QIDQ3776656zbMATH OpenOpenAlexFDO

Authors Fanica Gavril

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

zbMATH Keywords

acyclic hypergraphefficient algorithmmaximum spanning treespolynomial time algorithmtree representationsweighted graph

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to combinatorics (05-04) Hypergraphs (05C65) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 177570
• Counting Minimum Weight Spanning Trees
• scientific article; zbMATH DE number 56828
• Algorithms for Enumerating All Spanning Trees of Undirected and Weighted Graphs
• Efficient spanning trees

Cited in

(16)

• Maximum of k-th maximal spanning trees of a weighted graph
• Clique tree generalization and new subclasses of chordal graphs
• Intersection graphs of Helly families of subtrees
• The vertex leafage of chordal graphs
• Characterization of classical graph classes by weighted clique graphs
• An efficient representation of chordal graphs
• Intersection graphs of \(k\)-acyclic families of subtrees and relational database query processing.
• Minimum average distance clique trees
• An exact method to generate all nondominated spanning trees
• scientific article; zbMATH DE number 3977047 (Why is no real title available?)
• Reduced clique graphs of chordal graphs
• scientific article; zbMATH DE number 496232 (Why is no real title available?)
• Counting Minimum Weight Spanning Trees
• Graph-Theoretic Concepts in Computer Science
• Feature selection based on the best-path algorithm in high dimensional graphical models
• Intersection representations of matrices by subtrees and unicycles on graphs

This page was built for publication: Generating the maximum spanning trees of a weighted graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3776656)