Heuristic approaches to the maximization of the number of spanning trees in regular graphs

MaRDI QIDQ1840930zbMATH OpenFDO

Authors Jarosław Arabas, Błaẓej Sawionek, Jacek Wojciechowski

Publication date 18 September 2001

Published in Bulletin of the Polish Academy of Sciences. Technical Sciences (Search for Journal in Brave)

zbMATH Keywords

all terminal reliabilityevolutionary strategynumber of spanning treesregular graphs

Mathematics Subject Classification ID

Trees (05C05) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85) Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Heuristic maximization of the number of spanning trees in regular graphs
• Maximizing the number of spanning trees of networks based on cycle basis representation
• An approach to a problem in network design using genetic algorithms
• Maximizing the number of spanning trees of networks based on cycle basis representation
• On the characterization of graphs with maximum number of spanning trees

Cited in

(2)

• An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
• Heuristic maximization of the number of spanning trees in regular graphs

This page was built for publication: Heuristic approaches to the maximization of the number of spanning trees in regular graphs

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