4 papers · 1 filter
Linear-Time Algorithms for Finding Tucker Submatrices and Lekkerkerker-Boland Subgraphs
Nathan Lindzey, Ross M. McConnell
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…
Simple DFS on the Complement of a Graph and on Partially Complemented Digraphs
Benson Joeris, Nathan Lindzey, Ross M. McConnell +1
A complementation operation on a vertex of a digraph changes all outgoing arcs into non-arcs, and outgoing non-arcs into arcs. A partially complemented digraph is a…
Linear-Time Recognition of Probe Interval Graphs
Ross M. McConnell, Yahav Nussbaum
The interval graph for a set of intervals on a line consists of one vertex for each interval, and an edge for each intersecting pair of intervals. A probe interval graph is a varia…
On Finding Lekkerkerker-Boland Subgraphs
Nathan Lindzey, Ross McConnell
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…