Algorithm for sequential construction of spanning minimal directed forests

DOI10.1007/s10958-023-06666-wOpenAlexW4387221536MaRDI QIDQ6147861

V. A. Buslov

Publication date: 1 February 2024

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-023-06666-w

zbMATH Keywords

weighted digraphminimum weight spanning forests

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• On coefficients of the characteristic polynomial of the Laplace matrix of a weighted digraph and the all minors theorem
• Hierarchy of time scales in the case of weak diffusion
• Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
• On the characteristic polynomial and eigenvectors in terms of the tree-like structure of a digraph
• The structure of directed forests of minimal weight: algebra of subsets
• Structure of minimum-weight directed forests: related forests and convexity inequalities
• On the relationship between the multiplicities of the matrix spectrum and the signs of the components of its eigenvectors in a tree-like structure
• Finding optimum branchings
• Optimum branchings

This page was built for publication: Algorithm for sequential construction of spanning minimal directed forests