Results 271 to 280 of about 226,666 (311)
Correction for Regattieri et al., A speleothem record from the Fertile Crescent covering the last deglaciation better contextualizes neolithization. [PDF]
Proc Natl Acad Sci U S Aeuropepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Graph Theory, 1995
AbstractWe study a class of perfect graphs which, because they generalize interval graphs, we call pseudo‐interval graphs. Like interval graphs, their vertices correspond to intervals of a linearly ordered set, but a modified definition of intersection is used in order to determine edges.
Erik O. Brauner +2 more
openaire +1 more source
AbstractWe study a class of perfect graphs which, because they generalize interval graphs, we call pseudo‐interval graphs. Like interval graphs, their vertices correspond to intervals of a linearly ordered set, but a modified definition of intersection is used in order to determine edges.
Erik O. Brauner +2 more
openaire +1 more source
A CHARACTERIZATION OF COMPARABILITY GRAPHS AND OF INTERVAL GRAPHS
Canadian Journal of Mathematics, 1964Let < be a non-reflexive partial ordering defined on a set P. Let G(P, <) be the undirected graph whose vertices are the elements of P, and whose edges (a, b) connect vertices for which either a < b or b < a. A graph G with vertices P for which there exists a partial ordering < such that G = G(P, <) is called a comparability graph.In §
Gilmore, P. C., Hoffman, A. J.
openaire +2 more sources
ACM Transactions on Algorithms, 2012
We introduce a generalization of interval graphs, which we call Dotted Interval Graphs (DIG). A dotted interval graph is an intersection graph of arithmetic progressions (dotted intervals). Coloring of dotted interval graphs naturally arises in the context of high throughput genotyping.
Yonatan Aumann +4 more
openaire +1 more source
We introduce a generalization of interval graphs, which we call Dotted Interval Graphs (DIG). A dotted interval graph is an intersection graph of arithmetic progressions (dotted intervals). Coloring of dotted interval graphs naturally arises in the context of high throughput genotyping.
Yonatan Aumann +4 more
openaire +1 more source
International Journal of Data Mining, Modelling and Management, 2018
Frequent subgraph mining is a difficult data mining problem aiming to find the exact set of frequent subgraphs into a database of graphs. Current subgraph mining approaches make use of the canonical encoding which is one of the key operations. It is well known that canonical encodings have an exponential time complexity.
Amina, Kemmar +2 more
openaire +2 more sources
Frequent subgraph mining is a difficult data mining problem aiming to find the exact set of frequent subgraphs into a database of graphs. Current subgraph mining approaches make use of the canonical encoding which is one of the key operations. It is well known that canonical encodings have an exponential time complexity.
Amina, Kemmar +2 more
openaire +2 more sources
Recognizing d-Interval Graphs and d-Track Interval Graphs
Algorithmica, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Random Structures and Algorithms, 1998
Summary: We consider models for random interval graphs that are based on stochastic service systems, with vertices corresponding to customers and edges corresponding to pairs of customers that are in the system simultaneously. The number \(N\) of vertices in a connected component thus corresponds to the number of customers arriving during a busy period,
openaire +2 more sources
Summary: We consider models for random interval graphs that are based on stochastic service systems, with vertices corresponding to customers and edges corresponding to pairs of customers that are in the system simultaneously. The number \(N\) of vertices in a connected component thus corresponds to the number of customers arriving during a busy period,
openaire +2 more sources
SIAM Journal on Algebraic Discrete Methods, 1982
The interval count of an interval graph G is the minimum number of different interval sizes needed to represent the vertices of G, where two vertices are adjacent if and only if their intervals intersect.We show that if G is an interval graph and for some vertex x, $G - \{ x \}$ has interval count one, then G has interval count two or less.We also show
Leibowitz, R. +2 more
openaire +2 more sources
The interval count of an interval graph G is the minimum number of different interval sizes needed to represent the vertices of G, where two vertices are adjacent if and only if their intervals intersect.We show that if G is an interval graph and for some vertex x, $G - \{ x \}$ has interval count one, then G has interval count two or less.We also show
Leibowitz, R. +2 more
openaire +2 more sources
Interval digraphs: An analogue of interval graphs
Journal of Graph Theory, 1989AbstractIntersection digraphs analogous to undirected intersection graphs are introduced. Each vertex is assigned an ordered pair of sets, with a directed edge uv in the intersection digraph when the “source set” of u intersects the “terminal set” of v.
Sandip Das 0001 +3 more
openaire +2 more sources