INDUCTIVE ALGORITHMS ON FINITE TREES

DOI10.1080/16073606.1990.9631610zbMath0708.05018OpenAlexW2042345414MaRDI QIDQ3490010

Ronald I. Becker

Publication date: 1990

Published in: Quaestiones Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/16073606.1990.9631610

zbMATH Keywords

algorithmstreesgraph theoretic quantities

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (5)

Finding the \(\ell\)-core of a tree ⋮ Algorithms for central-median paths with bounded length on trees ⋮ On the finding 2-(k,l)-core of a tree with arbitrary real weight ⋮ The location of median paths on grid graphs ⋮ An algorithm for solving the bi-objective median path-shaped facility on a tree network

Cites Work

• A linear algorithm for the cutting center of a tree
• Finding the two-core of a tree
• Algorithms for finding P-centers on a weighted tree (for relatively small P)
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• A linear algorithm for a core of a tree

This page was built for publication: INDUCTIVE ALGORITHMS ON FINITE TREES