On the Consecutive-Retrieval Problem

DOI10.1137/S0097539792235487zbMath0795.05090OpenAlexW2030645588MaRDI QIDQ4291565

Donald K. Wagner, R. P. Swaminathan

Publication date: 14 September 1994

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0097539792235487

zbMATH Keywords

treealgorithmrealizationconsecutive retrieval property

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graph theory (including graph drawing) in computer science (68R10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Information storage and retrieval of data (68P20)

Related Items (3)

Vertices removal for feasibility of clustered spanning trees ⋮ The complete optimal stars-clustering-tree problem ⋮ A polynomial-time algorithm for optimal clustering in a special class of {0, l} -matrices

This page was built for publication: On the Consecutive-Retrieval Problem