A Linear Time Algorithm for Finding ak-Tree Core
From MaRDI portal
Recommendations
- Algorithms for a Core and k-Tree Core of a Tree
- scientific article; zbMATH DE number 2080269
- Finding a 2-core of a tree in linear time
- Efficient Algorithms for Finding a Core of a Tree with a Specified Length
- An efficient algorithm for finding the semi-obnoxious (k,l)-core of a tree
- Linear-time algorithms for tree root problems
- Linear-Time Algorithms for Tree Root Problems
- Efficient algorithms for finding the (k,l)-core of tree networks
- A linear algorithm for finding the k‐broadcast center of a tree
- A simple optimal parallel algorithm for a core of a tree
Cited in
(14)- Distributed algorithms for finding and maintaining a \(k\)-tree core in a dynamic network
- Finding the \(\ell\)-core of a tree
- Extensive facility location problems on networks: an updated review
- On the location of a constrained k-tree facility in a tree network with unreliable edges
- A linear time algorithm for balance vertices on trees
- Finding a 2-core of a tree in linear time
- Algorithms for a Core and k-Tree Core of a Tree
- On the finding 2-(k,l)-core of a tree with arbitrary real weight
- A simple solution to the k‐core problem
- scientific article; zbMATH DE number 1161366 (Why is no real title available?)
- scientific article; zbMATH DE number 2080269 (Why is no real title available?)
- Efficient algorithms for finding the (k,l)-core of tree networks
- A linear algorithm for finding the k‐broadcast center of a tree
- Efficient algorithms for a constrained k-tree core problem in a tree network
This page was built for publication: A Linear Time Algorithm for Finding ak-Tree Core
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4339005)
