An edge-swap heuristic for finding dense spanning trees

DOI10.20429/TAG.2016.030101zbMATH Open1416.05162OpenAlexW2210527938MaRDI QIDQ5225517

No author found.

Publication date: 22 July 2019

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

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)

Related Items (4)

A Faster Computation of All the Best Swap Edges of a Tree Spanner ⋮ An edge-swap heuristic for generating spanning trees with minimum number of branch vertices ⋮ 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

Recommendations

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