AbstractWe present a simple linear time algorithm for unit interval graph recognition. This algorithm uses 3 LBFS sweeps and then a very simple test to determine if the given graph is a unit interval graph. It is argued that this algorithm is the most easily implementable unit interval graph recognition algorithm known
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Abstract. A short proof is given that the graphs with proper interval representations are the same a...
Graphs and AlgorithmsA graph is a probe interval graph if its vertices can be partitioned into probe...
In their 2009 paper, Corneil et al. design a linear time interval graph recognition algorithm based ...
Given a family of (unit) intervals on the real line, can we recon-struct its distribution (sort the ...
An interval graph is the intersection graph of a collection of intervals. Interval graphs are a spec...
Give a graph class G and a nonnegative integer k, we use G+kv, G+ke, and G−ke to denote the classes ...
AbstractWe describe a linear time algorithm for the recognition of graphs that have an intersection ...
Interval graphs are the intersection graphs of families of intervals in the real line. If the interv...
A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes...
A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes...
AbstractWe describe a linear time algorithm for the recognition of graphs that have an intersection ...
AbstractIn this note, a constructive proof that the classes of proper interval graphs and unit inter...
We introduce the non-unit count of an interval graph as the minimum number of intervals in an interv...
AbstractGiven an interval graph G, the interval count problem is that of computing the minimum numbe...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Abstract. A short proof is given that the graphs with proper interval representations are the same a...
Graphs and AlgorithmsA graph is a probe interval graph if its vertices can be partitioned into probe...
In their 2009 paper, Corneil et al. design a linear time interval graph recognition algorithm based ...
Given a family of (unit) intervals on the real line, can we recon-struct its distribution (sort the ...
An interval graph is the intersection graph of a collection of intervals. Interval graphs are a spec...
Give a graph class G and a nonnegative integer k, we use G+kv, G+ke, and G−ke to denote the classes ...
AbstractWe describe a linear time algorithm for the recognition of graphs that have an intersection ...
Interval graphs are the intersection graphs of families of intervals in the real line. If the interv...
A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes...
A graph is a probe interval graph (PIG) if its vertices can be partitioned into probes and nonprobes...
AbstractWe describe a linear time algorithm for the recognition of graphs that have an intersection ...
AbstractIn this note, a constructive proof that the classes of proper interval graphs and unit inter...
We introduce the non-unit count of an interval graph as the minimum number of intervals in an interv...
AbstractGiven an interval graph G, the interval count problem is that of computing the minimum numbe...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Abstract. A short proof is given that the graphs with proper interval representations are the same a...
Graphs and AlgorithmsA graph is a probe interval graph if its vertices can be partitioned into probe...