On the finding 2-(k,l)-core of a tree with arbitrary real weight

DOI10.22067/ijnao.v9i1.65852OpenAlexW3116484015MaRDI QIDQ3389575

Jafar Fathali, S. M. Ashkezari

Publication date: 23 March 2022

Full work available at URL: https://ijnao.um.ac.ir/article_24787_186bfec924d7eddc3d86bc2cfda26488.pdf

zbMATH Keywords

corefacility locationsemi-obnoxiousMedian subtree

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Cites Work

• Unnamed Item
• Two paths location of a tree with positive or negative weights
• Algorithms for a Core and k-Tree Core of a Tree
• On finding the core of a tree with a specified length
• INDUCTIVE ALGORITHMS ON FINITE TREES
• A linear algorithm for a core of a tree
• A Linear Time Algorithm for Finding ak-Tree Core
• Efficient Algorithms for Finding a Core of a Tree with a Specified Length

This page was built for publication: On the finding 2-(k,l)-core of a tree with arbitrary real weight