Results 291 to 300 of about 3,018,719 (345)

Recognizing d-Interval Graphs and d-Track Interval Graphs

Algorithmica, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

Weighted irredundance of interval graphs

Information Processing Letters, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chang, Maw-Shang, Nagavamsi, P., Pandu Rangan, C.   +2 more
openaire   +2 more sources

Interval graphs and maps of DNA

Bulletin of Mathematical Biology, 1986
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Waterman, Michael S., Griggs, Jerrold R.
openaire   +3 more sources

Variations on interval graphs

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., Lundgren, J. R., Miller, C.   +2 more
openaire   +1 more source

Tagged Probe Interval Graphs

Journal of Combinatorial Optimization, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sheng, Li, Wang, Chi, Zhang, Peisen
openaire   +2 more sources

Graph Searching and Interval Completion

SIAM Journal on Discrete Mathematics, 2000
In 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

Interval \(k\)-graphs

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., Flink, S. C., Lundgren, J. R.   +2 more
openaire   +1 more source

Interval digraphs: An analogue of interval graphs

Journal of Graph Theory, 1989
AbstractIntersection 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.
Sen, M., Das, S., Roy, A. B., West, D. B.   +3 more
openaire   +2 more sources

Interval graph of facial regions with common intersection salient points for identifying and classifying facial expression

Multimedia tools and applications, 2020
V. S. Avani, S. Shaila, A. Vadivel
semanticscholar   +1 more source

On the Interval Number of a Triangulated Graph

Journal of Graph Theory, 1987
AbstractThe interval number of a simple undirected graph G, denoted i(G), is the least nonnegative integer r for which we can assign to each vertex in G a collection of at most r intervals on the real line such that two distinct vertices v and w of G are adjacent if and only if some interval for v intersects some interval for w. For triangulated graphs
openaire   +2 more sources