On the Consecutive-Retrieval Problem

DOI10.1137/S0097539792235487zbMath0795.05090MaRDI QIDQ4291565

Donald K. Wagner, R. P. Swaminathan

Publication date: 14 September 1994

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

zbMATH Keywords

tree; algorithm; realization; consecutive retrieval property

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C05: Trees

05B20: Combinatorial aspects of matrices (incidence, Hadamard, etc.)

68R10: Graph theory (including graph drawing) in computer science

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

68P20: Information storage and retrieval of data

Related Items

The complete optimal stars-clustering-tree problem, A polynomial-time algorithm for optimal clustering in a special class of {0, l} -matrices