The following pages link to Finding cores of limited length (Q5096925):
Displaying 9 items.
- Algorithms for central-median paths with bounded length on trees (Q864041) (← links)
- Finding the conditional location of a median path on a tree (Q937298) (← links)
- Revisiting \(k\)-sum optimization (Q1675256) (← links)
- Finding an optimal core on a tree network with M/G/c/c state-dependent queues (Q1731597) (← links)
- Efficient algorithms for the minmax regret path center problem with length constraint on trees (Q2136270) (← links)
- An improved algorithm for the minmax regret path center problem on trees (Q2194857) (← links)
- Succinct Greedy Graph Drawing in the Hyperbolic Plane (Q3611834) (← links)
- Finding cores of limited length (Q5096925) (← links)
- Finding the most degree-central walks and paths in a graph: exact and heuristic approaches (Q6167664) (← links)
