Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs
Discrete Mathematics
2014-01-03 v1 Data Structures and Algorithms
Combinatorics
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 binary matrices that do not have the consecutive-ones property. We give a linear-time algorithm to find one in any binary matrix that does not have the consecutive-ones property.
Cite
@article{arxiv.1401.0224,
title = {Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs},
author = {Nathan Lindzey and Ross M. McConnell},
journal= {arXiv preprint arXiv:1401.0224},
year = {2014}
}
Comments
A preliminary version of this work appeared in WG13: 39th International Workshop on Graph-Theoretic Concepts in Computer Science