Results 1 to 10 of about 3,546,741 (346)
We work out a graph limit theory for dense interval graphs. The theory developed departs from the usual description of a graph limit as a symmetric function W(x, y) on the unit square, with x and y uniform on the interval (0, 1).
Diaconis P, Holmes S, Janson S.
europepmc +8 more sources
Extremal Values of the Interval Number of a Graph [PDF]
The interval number $i( G )$ of a simple graph $G$ is the smallest number $t$ such that to each vertex in $G$ there can be assigned a collection of at most $t$ finite closed intervals on the real line so that there is an edge between vertices $v$ and $w$
B. West, Douglas, Jerrold R. Griggs
core +3 more sources
Classes of graphs with restricted interval models [PDF]
We introduce q-proper interval graphs as interval graphs with interval models in which no interval is properly contained in more than q other intervals, and also provide a forbidden induced subgraph characterization of this class of graphs.
Andrzej Proskurowski, Jan Arne Telle
doaj +3 more sources
A new haplotype block detection method for dense genome sequencing data based on interval graph modeling of clusters of highly correlated SNPs. [PDF]
Kim SA, Cho CS, Kim SR, Bull SB, Yoo YJ.
europepmc +2 more sources
On the One Dimensional Poisson Random Geometric Graph [PDF]
Given a Poisson process on a bounded interval, its random geometric graph is the graph whose vertices are the points of the Poisson process, and edges exist between two points if and only if their distance is less than a fixed given threshold. We compute
L. Decreusefond, E. Ferraz
doaj +7 more sources
Cubicity of interval graphs and the claw number
Let $G(V,E)$ be a simple, undirected graph where $V$ is the set of vertices and $E$ is the set of edges. A $b$-dimensional cube is a Cartesian product $I_1\times I_2\times...\times I_b$, where each $I_i$ is a closed interval of unit length on the real ...
Adiga, Abhijin, Chandran, L. Sunil
core +4 more sources
A Note on the Interval Function of a Disconnected Graph
In this note we extend the Mulder-Nebeský characterization of the interval function of a connected graph to the disconnected case. One axiom needs to be adapted, but also a new axiom is needed in addition.
Changat Manoj+3 more
doaj +2 more sources
Time Interval-Enhanced Graph Neural Network for Shared-Account Cross-Domain Sequential Recommendation [PDF]
Shared-account cross-domain sequential recommendation (SCSR) task aims to recommend the next item via leveraging the mixed user behaviors in multiple domains.
Lei Guo+5 more
semanticscholar +1 more source
On minimal augmentation of a graph to obtain an interval graph
Tatsuo Ohtsuki+3 more
openalex +2 more sources
Learning semantic program embeddings with graph interval neural network [PDF]
Learning distributed representations of source code has been a challenging task for machine learning models. Earlier works treated programs as text so that natural language methods can be readily applied.
Yu Wang+3 more
semanticscholar +1 more source