Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs

@article{Lindzey2016LinearTimeAF,
  title={Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs},
  author={Nathan Lindzey and Ross M. McConnell},
  journal={SIAM J. Discrete Math.},
  year={2016},
  volume={30},
  pages={43-69}
}
Lekkerkerker and Boland characterized the minimal forbidden induced subgraphs for the class of interval graphs. We give a lineartime 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 lineartime algorithm to find one in any binary matrix that does not have the consecutive-ones property. 
Related Discussions
This paper has been referenced on Twitter 3 times. VIEW TWEETS

References

Publications referenced by this paper.
Showing 1-10 of 26 references

Similar Papers

Loading similar papers…