A linear algorithm for a core of a tree

DOI10.1016/0196-6774(80)90012-7zbMath0454.68067OpenAlexW1991466654MaRDI QIDQ3902510

Christine A. Morgan, Peter J. Slater

Publication date: 1980

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

Full work available at URL: https://doi.org/10.1016/0196-6774(80)90012-7

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38)

Related Items (40)

Parallel algorithm for finding a core of a tree network ⋮ Finding the two-core of a tree ⋮ Efficient algorithms for the minmax regret path center problem with length constraint on trees ⋮ A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ 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 ⋮ An improved algorithm for the minmax regret path centdian problem on trees ⋮ Two Paths Location of a Tree with Positive or Negative Weights ⋮ INDUCTIVE ALGORITHMS ON FINITE TREES ⋮ On the finding 2-(k,l)-core of a tree with arbitrary real weight ⋮ Finding cores of limited length ⋮ On fixed-parameter solvability of the minimax path location problem ⋮ Finding a core of a tree with pos/neg weight ⋮ The extensive 1-median problem with radius on networks ⋮ Two paths location of a tree with positive or negative weights ⋮ An improved algorithm for the minmax regret path center problem on trees ⋮ Open neighborhood locating-dominating in trees ⋮ Proximity and average eccentricity of a graph ⋮ Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem ⋮ Finding an optimal core on a tree network with M/G/c/c state-dependent queues ⋮ Finding the conditional location of a median path on a tree ⋮ Locating median paths on connected outerplanar graphs ⋮ The location of median paths on grid graphs ⋮ A branch-and-cut algorithm for the median-path problem ⋮ The path-variance problem on tree networks ⋮ Locating tree-shaped facilities using the ordered median objective ⋮ The continuous and discrete path‐variance problems on trees ⋮ 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 ⋮ Partial and perfect path covers of cographs ⋮ Location of paths on trees with minimal eccentricity and superior section ⋮ A linear algorithm for the number of degree constrained subforests of a tree ⋮ Parity dimension for graphs ⋮ Reliability problems in multiple path-shaped facility location on networks ⋮ A unifying location model on tree graphs based on submodularity property ⋮ On the minmax regret path median problem on trees

This page was built for publication: A linear algorithm for a core of a tree