scientific article

zbMath1059.68563MaRDI QIDQ3044351

Martín Farach-Colton, Michael A. Bender

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2286/22860508.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Searching and sorting (68P10) Data structures (68P05)

Related Items (10)

String covers of a tree ⋮ Swapping a failing edge of a shortest paths tree by minimizing the average stretch factor ⋮ Morphing tree drawings in a small 3D grid ⋮ Space-time trade-offs for finding shortest unique substrings and maximal unique matches ⋮ Succinct representations of permutations and functions ⋮ Finding best swap edges minimizing the routing cost of a spanning tree ⋮ Range minimization problems in path-facility location on trees ⋮ Center location problems on tree graphs with subtree-shaped customers ⋮ The Level-Ancestor problem on pure pointer machines ⋮ Minimax regret path location on trees

This page was built for publication: