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

DOI10.22067/IJNAO.V9I1.65852OpenAlexW3116484015MaRDI QIDQ3389575FDOQ3389575

Authors: S. M. Ashkezari, Jafar Fathali 

Publication date: 23 March 2022

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

Recommendations

• Finding the \(\ell\)-core of a tree
• An efficient algorithm for finding the semi-obnoxious \((k,l)\)-core of a tree
• On finding the core of a tree with a specified length
• Finding a 2-core of a tree in linear time
• Algorithms for a Core and k-Tree Core of a Tree
• Efficient algorithms for finding the (k,l)-core of tree networks
• scientific article; zbMATH DE number 2080269
• A Linear Time Algorithm for Finding ak-Tree Core
• Construction of the compact core of a real tree by tree substitution
• A note on \(L (2, 1)\)-labelling of trees

zbMATH Keywords

corefacility locationsemi-obnoxiousMedian subtree

Mathematics Subject Classification ID

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

Cites Work

• Efficient Algorithms for Finding a Core of a Tree with a Specified Length
• A linear algorithm for a core of a tree
• Algorithms for a Core and k-Tree Core of a Tree
• INDUCTIVE ALGORITHMS ON FINITE TREES
• Two paths location of a tree with positive or negative weights
• On finding the core of a tree with a specified length
• An efficient algorithm for finding the semi-obnoxious \((k,l)\)-core of a tree
• A Linear Time Algorithm for Finding ak-Tree Core

Cited In (1)

• Finding the \(\ell\)-core of a tree

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

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