An edge-swap heuristic for finding dense spanning trees

DOI10.20429/TAG.2016.030101MaRDI QIDQ5225517zbMATH OpenOpenAlexFDO

Authors

Publication date 22 July 2019

Published in Theory and Applications of Graphs (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.20429/tag.2016.030101

zbMATH Keywords

computational resultsrandomly generated graphs

Mathematics Subject Classification ID

Trees (05C05) Density (toughness, etc.) (05C42)

Recommendations

• An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
• A Faster Computation of All the Best Swap Edges of a Tree Spanner
• An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner
• An improved algorithm for computing all the best swap edges of a tree spanner
• A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners
• Spanning trees in dense graphs
• Heuristic and exact algorithms for the spanning tree detection problem
• A Distributed Algorithm for Finding All Best Swap Edges of a Minimum Diameter Spanning Tree
• Faster swap edge computation in minimum diameter spanning trees

Cited in

(5)

• An improved algorithm for computing all the best swap edges of a tree spanner
• An edge-swap heuristic for generating spanning trees with minimum number of branch vertices
• A Faster Computation of All the Best Swap Edges of a Tree Spanner
• scientific article; zbMATH DE number 1933253 (Why is no real title available?)
• An Improved Algorithm for Computing All the Best Swap Edges of a Tree Spanner

This page was built for publication: An edge-swap heuristic for finding dense spanning trees

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