Algorithms and Computation

DOI10.1007/11602613zbMath1175.05125OpenAlexW2304246803MaRDI QIDQ5897902

Binay K. Bhattacharya, Boaz Ben-Moshe, Qiaosheng Shi

Publication date: 14 November 2006

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

Full work available at URL: https://doi.org/10.1007/11602613

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

Algorithms for graphs of bounded treewidth via orthogonal range searching ⋮ On the sizes of generalized cactus graphs ⋮ Backup 2-center on interval graphs ⋮ \(k\)-balanced center location problem: a new multi-objective facility location problem ⋮ A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler ⋮ The 2-radius and 2-radiian problems on trees ⋮ Chain hexagonal cacti: matchings and independent sets ⋮ The backup 2‐center and backup 2‐median problems on trees ⋮ Bumblebee visitation problem

This page was built for publication: Algorithms and Computation