On finding the core of a tree with a specified length

DOI10.1016/0196-6774(83)90015-9zbMath0548.05023OpenAlexW1994798705MaRDI QIDQ3340877

Edward Minieka, N. H. Patel

Publication date: 1983

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(83)90015-9

zbMATH Keywords

coremedianminimum distance

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38)

Related Items (14)

Parallel algorithm for finding a core of a tree network ⋮ Locating median cycles in networks ⋮ On the finding 2-(k,l)-core of a tree with arbitrary real weight ⋮ Finding cores of limited length ⋮ The extensive 1-median problem with radius on networks ⋮ Finding the conditional location of a median path on a tree ⋮ A branch-and-cut algorithm for the median-path problem ⋮ Locating tree-shaped facilities using the ordered median objective ⋮ Core and Conditional Core Path of Specified Length in Special Classes of Graphs ⋮ On the location of a constrained \(k\)-tree facility in a tree network with unreliable edges ⋮ An algorithm for solving the bi-objective median path-shaped facility on a tree network ⋮ A review of extensive facility location in networks ⋮ Minimax regret path location on trees ⋮ The centdian subtree on tree networks

This page was built for publication: On finding the core of a tree with a specified length