Pith. sign in

REVIEW 1 cited by

On Finding Lekkerkerker-Boland Subgraphs

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1303.1840 v1 pith:FVCQ6UM5 submitted 2013-03-07 cs.DM cs.DSmath.CO

Nathan Lindzey , Ross McConnell This is my paper · ORCID
classification cs.DMcs.DSmath.CO
keywords algorithmcharacterizedconsecutive-onesfindforbiddengivegraphinterval
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Lekkerkerker and Boland characterized the minimal forbidden induced subgraphs for the class of interval graphs. We give a linear-time algorithm to find one in any graph that is not an interval graph. Tucker characterized the minimal forbidden submatrices of matrices that do not have the consecutive-ones property. We give a linear-time algorithm to find one in any matrix that does not have the consecutive-ones property.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Practical approach to $2$-Euclidean Preferences

    cs.GT 2025-02 conditional novelty 7.0 of 10

    A suite of convex-hull forbidden substructures, reduction rules, ILP, and QCP recognizes 2-Euclidean elections quickly, solving 283 more PrefLib instances than the previous algorithm.

Pith tools