INDUCTIVE ALGORITHMS ON FINITE TREES

DOI10.1080/16073606.1990.9631610MaRDI QIDQ3490010zbMATH OpenOpenAlexFDO

Authors 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

algorithmsgraph theoretic quantitiestrees

Mathematics Subject Classification ID

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

Recommendations

• A generalized algorithm for centrality problems on trees
• Algorithms for a Core and k-Tree Core of a Tree
• Finding the \(\ell\)-core of a tree
• scientific article; zbMATH DE number 2188478
• Finding the two-core of a tree

Cites work

• A linear algorithm for a core of a tree
• A linear algorithm for the cutting center 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
• Finding the two-core of a tree

Cited in

(9)

• Finding the \(\ell\)-core of a tree
• A typical vertex of a tree
• An algorithm for solving the bi-objective median path-shaped facility on a tree network
• The location of median paths on grid graphs
• Recursive proofs for inductive tree data-structures
• On the finding 2-(k,l)-core of a tree with arbitrary real weight
• scientific article; zbMATH DE number 4164161 (Why is no real title available?)
• Subsumption algorithms based on search trees
• Algorithms for central-median paths with bounded length on trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3490010)