Results 231 to 240 of about 147,371 (263)
Some of the next articles are maybe not open access.
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
Characterizing interval graphs which are probe unit interval graphs
Discrete Applied Mathematics, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
2002
Summary: We introduce interval \(k\)-graphs, a family of restricted intersection graphs. The intersection model for interval \(k\)-graphs assigns each vertex to a unique interval in some copy of the real line, with two vertices adjacent whenever their corresponding intervals overlap and belong to distinct copies of \(\mathbb{R}\). Our work is motivated
Brown, David E. +2 more
openaire +1 more source
Summary: We introduce interval \(k\)-graphs, a family of restricted intersection graphs. The intersection model for interval \(k\)-graphs assigns each vertex to a unique interval in some copy of the real line, with two vertices adjacent whenever their corresponding intervals overlap and belong to distinct copies of \(\mathbb{R}\). Our work is motivated
Brown, David E. +2 more
openaire +1 more source
Journal of Graph Theory, 1993
AbstractAn interval graph is said to be extremal if it achieves, among all interval graphs having the same number of vertices and the same clique number, the maximum possible number of edges. We give an intrinsic characterization of extremal interval graphs and derive recurrence relations for the numbers of such graphs.
openaire +1 more source
AbstractAn interval graph is said to be extremal if it achieves, among all interval graphs having the same number of vertices and the same clique number, the maximum possible number of edges. We give an intrinsic characterization of extremal interval graphs and derive recurrence relations for the numbers of such graphs.
openaire +1 more source
2001
A bipartite graph with partitions \(P\) and \(C\) is called an interval bigraph, if there exists a family of intervals which associates each vertex of \(G=(V, E)\) with an interval, and for \(x,y \in V\) the edge between \(x\) and \(y\) is in \(E\) if the corresponding intervals intersect and at least one of \(x\) and \(y\) is in \(P\). After a lengthy
Brown, David E. +2 more
openaire +1 more source
A bipartite graph with partitions \(P\) and \(C\) is called an interval bigraph, if there exists a family of intervals which associates each vertex of \(G=(V, E)\) with an interval, and for \(x,y \in V\) the edge between \(x\) and \(y\) is in \(E\) if the corresponding intervals intersect and at least one of \(x\) and \(y\) is in \(P\). After a lengthy
Brown, David E. +2 more
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
Combinatorica, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Weighted irredundance of interval graphs
Information Processing Letters, 1998zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chang, Maw-Shang +2 more
openaire +2 more sources
Graph Searching and Interval Completion
SIAM Journal on Discrete Mathematics, 2000In the classical node-search version for a finite simple undirected graph, in a sequence of moves, at every move a searcher is placed at a vertex or is removed from a vertex. Initially all edges are contaminated (uncleared). A contaminated edge \(xy\) is cleared if on \(x\) and \(y\) searchers are placed. A cleared edge \(e\) is recontaminated if there
Fomin, Fedor V., Golovach, Petr A.
openaire +2 more sources