Finding cores of limited length

DOI10.1007/3-540-63307-3_47OpenAlexW1534135413MaRDI QIDQ5096925

Peer Sommerlund, Stephen Alstrup, Mikkel Thorup, P. W. Lauridsen

Publication date: 19 August 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63307-3_47

zbMATH Keywords

piecewise linear functionlinear-time algorithmcore problemlower envelopeleaf tree

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Trees (05C05) Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

Efficient algorithms for the minmax regret path center problem with length constraint on trees ⋮ Algorithms for central-median paths with bounded length on trees ⋮ Revisiting \(k\)-sum optimization ⋮ Finding cores of limited length ⋮ An improved algorithm for the minmax regret path center problem on trees ⋮ Finding the most degree-central walks and paths in a graph: exact and heuristic approaches ⋮ 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 ⋮ Succinct Greedy Graph Drawing in the Hyperbolic Plane

Cites Work

• Unnamed Item
• Unnamed Item
• Nonlinearity of Davenport-Schinzel sequences and of generalized path compression schemes
• On locating path- or tree-shaped facilities on networks
• Algorithms for a Core and k-Tree Core of a Tree
• Fast Algorithms for Finding Nearest Common Ancestors
• On finding the core of a tree with a specified length
• The optimal location of a path or tree in a tree network
• A linear algorithm for a core of a tree
• Efficient Algorithms for Finding a Core of a Tree with a Specified Length
• Finding cores of limited length
• A Combinatorial Problem Connected with Differential Equations

This page was built for publication: Finding cores of limited length