SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekDEGerman
A graph is a probe interval graph if its vertices can be partitioned into probes and nonprobes with ...
AbstractWe describe a linear time algorithm for the recognition of graphs that have an intersection ...
A graph G is a tolerance graph if and only if each vertex v ∈ V (G) can be associated with an interv...
Available from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-24105 Kie...
An interval graph is the intersection graph of a collection of intervals. Interval graphs are a spec...
Interval graphs are the intersection graphs of families of intervals in the real line. If the interv...
In their 2009 paper, Corneil et al. design a linear time interval graph recognition algorithm based ...
Abstract. Interval graphs are intersection graphs of closed intervals of the real-line. The well-kno...
The square of a graph G=(V,E), denoted by G2, is a graph on the same vertex set V(G) such that two v...
A graph is an interval graph if and only if each of its vertices can be associated with an interval ...
AbstractThe square of a graph G=(V,E), denoted by G2, is a graph on the same vertex set V(G) such th...
A certifying algorithm for a problem is an algorithm that provides a certificate with each answer t...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Graphs and AlgorithmsA graph is a probe interval graph if its vertices can be partitioned into probe...
A graph is a probe interval graph if its vertices can be partitioned into probes and nonprobes with ...
A graph is a probe interval graph if its vertices can be partitioned into probes and nonprobes with ...
AbstractWe describe a linear time algorithm for the recognition of graphs that have an intersection ...
A graph G is a tolerance graph if and only if each vertex v ∈ V (G) can be associated with an interv...
Available from Bibliothek des Instituts fuer Weltwirtschaft, ZBW, Duesternbrook Weg 120, D-24105 Kie...
An interval graph is the intersection graph of a collection of intervals. Interval graphs are a spec...
Interval graphs are the intersection graphs of families of intervals in the real line. If the interv...
In their 2009 paper, Corneil et al. design a linear time interval graph recognition algorithm based ...
Abstract. Interval graphs are intersection graphs of closed intervals of the real-line. The well-kno...
The square of a graph G=(V,E), denoted by G2, is a graph on the same vertex set V(G) such that two v...
A graph is an interval graph if and only if each of its vertices can be associated with an interval ...
AbstractThe square of a graph G=(V,E), denoted by G2, is a graph on the same vertex set V(G) such th...
A certifying algorithm for a problem is an algorithm that provides a certificate with each answer t...
SIGLECopy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Kar...
Graphs and AlgorithmsA graph is a probe interval graph if its vertices can be partitioned into probe...
A graph is a probe interval graph if its vertices can be partitioned into probes and nonprobes with ...
A graph is a probe interval graph if its vertices can be partitioned into probes and nonprobes with ...
AbstractWe describe a linear time algorithm for the recognition of graphs that have an intersection ...
A graph G is a tolerance graph if and only if each vertex v ∈ V (G) can be associated with an interv...