Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Open accessIntegrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
When the family has the consecutive-ones property a suitable leaf order is found by PQ-trees, giving the (loose) bound of Section 3.1.
“When the family has the consecutive-ones property a suitable leaf order is found by PQ-trees [1], giving the (loose) bound of Section 3.1.”
From Prefix Sharing Is a Sorting Problem (2026) · cites this paper as [1]
Cited by
Sorted by citations
Trapnell, C., Cacchiarelli, D., Grimsby, J., Pokharel, P., Li, S., Morse, M., Lennon, N. J., Livak, K. J., Mikkelsen, T. S., & Rinn, J. L. (2014) · Nature Biotechnology · doi:10.1038/nbt.2859 · Cited by 7,314 · see citing works
Revealing the vectors of cellular identity with single-cell genomics
Wagner, A., Regev, A., & Yosef, N. (2016) · Nature Biotechnology · doi:10.1038/nbt.3711 · Cited by 632 · see citing works
Prefix Sharing Is a Sorting Problem
He, R. (2026) · arXiv · doi:10.48550/arxiv.2609.13692
- Authors
- Booth, K. S., & Lueker, G. S.
- Affiliations
- Lawrence Livermore National Laboratory (US)
- University of California, Irvine (US)
- ORCID
- Booth, Kellogg S.
- Venue
- Journal of Computer and System Sciences
- Publisher
- Elsevier BV
- Published
- 1976-12
- Volume
- 13
- Issue
- 3
- Pages
- 335-379
- ISSN
- 0022-0000 (ISSN-L)
- OpenAlex
- W2024491681
- Cited by
- 1,488
- References
- 0
- Citations by year
- 2026: 17 · 2025: 18 · 2024: 21 · 2023: 37 · 2022: 37 · 2021: 34 · 2020: 39 · 2019: 41 · 2018: 42 · 2017: 37 · 2016: 49 · 2015: 44 · 2014: 47 · 2013: 51 · 2012: 66
- FWCI
- 5.35
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Journal of Computer and System Sciences (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Advanced Graph Theory Research
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Complexity and Algorithms in Graphs
- Physical Sciences › Computer Science › Artificial Intelligence › Algorithms and Data Compression
- Keywords
- PQ-trees, consecutive ones property, interval graphs, graph planarity, chordal graphs, linear-time algorithms, permutation representations, graph recognition
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
