Recommendations
Cites work
- A data structure for dynamic trees
- A new data structure for representing sorted lists
- A Shifting Algorithm for Min-Max Tree Partitioning
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location Problems
- Design and Analysis of a Data Structure for Representing Sorted Lists
- Finding kth paths and p-centers by generating and searching good data structures
- scientific article; zbMATH DE number 432817 (Why is no real title available?)
- scientific article; zbMATH DE number 177557 (Why is no real title available?)
- scientific article; zbMATH DE number 1522948 (Why is no real title available?)
- scientific article; zbMATH DE number 1559542 (Why is no real title available?)
- Max-Min Tree Partitioning
- New Results on the Complexity of p-Centre Problems
- Slowing down sorting networks to obtain faster sorting algorithms
Cited in
(8)- The weighted \(k\)-center problem in trees for fixed \(k\)
- Longest distance of a non-uniform dispersion process on the infinite line
- scientific article; zbMATH DE number 1696526 (Why is no real title available?)
- Maximal Spacing Configurations in Graphs
- Dispersion processes
- Maximum dispersion problem in dense graphs
- From data completion to problems on hypercubes: a parameterized analysis of the independent set problem
- From data completion to problems on hypercubes: a parameterized analysis of the independent set problem
This page was built for publication: Dispersion on trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111728)
