On the Consecutive-Retrieval Problem

DOI10.1137/S0097539792235487MaRDI QIDQ4291565zbMATH OpenOpenAlexFDO

Authors R. P. Swaminathan, Donald K. Wagner

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

algorithmconsecutive retrieval propertyrealizationtree

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 5606342
• A Simple Test for the Consecutive Ones Property
• On testing consecutive-ones property in parallel
• An Almost Linear-Time Algorithm for Graph Realization

Cited in

(11)

• The complete optimal stars-clustering-tree problem
• Vertices removal for feasibility of clustered spanning trees
• Consecutive retrieval property -- revisited
• A Simple Test for the Consecutive Ones Property
• scientific article; zbMATH DE number 3860441 (Why is no real title available?)
• scientific article; zbMATH DE number 3874670 (Why is no real title available?)
• scientific article; zbMATH DE number 3874671 (Why is no real title available?)
• An Almost Linear-Time Algorithm for Graph Realization
• A polynomial-time algorithm for optimal clustering in a special class of {0, l} -matrices
• Decomposing the feasibility of clustered spanning tree by paths
• The role of twins in computing planar supports of hypergraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4291565)