Efficient Algorithms for Finding a Core of a Tree with a Specified Length
From MaRDI portal
Publication:4881403
DOI10.1006/jagm.1996.0022zbMath0845.68053OpenAlexW2085637279MaRDI QIDQ4881403
Publication date: 9 June 1996
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1996.0022
Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)
Related Items
An efficient algorithm for the length-constrained heaviest path problem on a tree, Finding the \(\ell\)-core of a tree, Algorithms for central-median paths with bounded length on trees, Extensive facility location problems on networks: an updated review, On the finding 2-(k,l)-core of a tree with arbitrary real weight, Finding cores of limited length, Finding a core of a tree with pos/neg weight, Comparing different metaheuristic approaches for the median path problem with bounded length, Finding the conditional location of a median path on a tree, The location of median paths on grid graphs, 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, Minimax regret path location on trees, An optimal algorithm for solving the 1-median problem on weighted 4-cactus graphs, The centdian subtree on tree networks
