Results 301 to 310 of about 3,546,741 (346)
Some of the next articles are maybe not open access.
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 +3 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 +3 more sources
Recognizing d-Interval Graphs and d-Track Interval Graphs [PDF]
Algorithmica, 2010 A d-interval is the union of d disjoint intervals on the real line. A d-track interval is the union of d disjoint intervals on d disjoint parallel lines called tracks, one interval on each track. As generalizations of the ubiquitous interval graphs, d-interval graphs and d-track interval graphs have wide applications, traditionally to scheduling and ...
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 +2 more sources
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 +2 more sources
Interval graphs and maps of DNA
Bulletin of Mathematical Biology, 1986zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael S. Waterman, Jerrold R. Griggs
openaire +4 more sources
Combinatorica, 1988
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Interval valued m-polar fuzzy planar graph and its application
Artificial Intelligence Review, 2020Tanmoy Mahapatra +3 more
semanticscholar +1 more source
Persistent graph stream summarization for real-time graph analytics
World wide web (Bussum), 2023Yan Jia +4 more
semanticscholar +1 more source
Separator Theorems for Interval Graphs and Proper Interval Graphs
2015C.L.Monma and V.K.Wei [1986, J. Comb. Theory, Ser-B, 41, 141-181] proposed a unified approach to characterize several subclasses of chordal graphs using clique separator. The characterizations so obtained are called separator theorems. Separator theorems play an important role in designing algorithms in subclasses of chordal graphs.
openaire +2 more sources
Decision-making method based on the interval valued neutrosophic graph
Future Technologies Conference, 2016S. Broumi +3 more
semanticscholar +1 more source
Interval fuzzy preferences in the graph model for conflict resolution
Fuzzy Optimization and Decision Making, 2017M. A. Bashar +3 more
semanticscholar +1 more source