Parameterized algorithms for computing MAD trees
From MaRDI portal
Cites work
- A linear-time algorithm to compute a MAD tree of an interval graph
- A Polynomial-Time Approximation Scheme for Minimum Routing Cost Spanning Trees
- Distance preserving subtrees in minimum average distance spanning trees
- Distributed approximation of minimum routing cost trees
- Efficient and Adaptive Parameterized Algorithms on Modular Decompositions
- Exact algorithms for minimum routing cost trees
- Extremal values for ratios of distances in trees
- Fully polynomial FPT algorithms for some classes of bounded clique-width graphs
- Fundamentals of parameterized complexity
- Geometric spanning trees minimizing the Wiener index
- scientific article; zbMATH DE number 1052827 (Why is no real title available?)
- scientific article; zbMATH DE number 1463394 (Why is no real title available?)
- scientific article; zbMATH DE number 861418 (Why is no real title available?)
- MAD trees and distance-hereditary graphs
- On the computational complexity of vertex integrity and component order connectivity
- On the minimum diameter spanning tree problem
- Optimum Communication Spanning Trees
- Optimum Communication Spanning Trees in Series-Parallel Networks
- Parameterized algorithms
- Parameterized Algorithms for Modular-Width
- Shortest shortest path trees of a network
- Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
- Solving the optimum communication spanning tree problem
- The \(k\)-leaf spanning tree problem admits a klam value of 39
- The complexity of the network design problem
- The minimum routing cost tree problem. State of the art and a core-node based heuristic algorithm
- Wiener index of trees: Theory and applications
This page was built for publication: Parameterized algorithms for computing MAD trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363378)
