Results 1 to 10 of about 3,018,719 (345)
Ann Comb, 2013 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 +9 more sources
Closed graphs are proper interval graphs [PDF]
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2014 Let G be a connected simple graph. We prove that G is a closed graph if and only if G is a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.
Crupi Marilena, Rinaldo Giancarlo
doaj +2 more sources
Exactly Hittable Interval Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 Given a set system $\mathcal{X} = \{\mathcal{U},\mathcal{S}\}$, where $\mathcal{U}$ is a set of elements and $\mathcal{S}$ is a set of subsets of $\mathcal{U}$, an exact hitting set $\mathcal{U}'$ is a subset of $\mathcal{U}$ such that each subset in $\mathcal{S}$ contains exactly one element in $\mathcal{U}'$.
S. M. Dhannya +2 more
openalex +4 more sources
On the enumeration of interval graphs [PDF]
Proceedings of the American Mathematical Society, Series B, 2017 We present upper and lower bounds for the number i n i_n of interval graphs on n n vertices. Answering a question posed by Hanlon, we show that the ordinary generating function I ( x ) = ∑ n ≥ 0
Joyce C. Yang, Nicholas Pippenger
openalex +4 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]
Bioinformatics, 2018 Kim SA, Cho CS, Kim SR, Bull SB, Yoo YJ.
europepmc +2 more sources
A Note on the Interval Function of a Disconnected Graph
Discussiones Mathematicae Graph Theory, 2018 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]
IEEE Transactions on Neural Networks and Learning Systems, 2022 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
International Journal of Data Mining Modelling and Management, 2018 Amina Kemmar, Yahia Lebbah, Samir Loudni
openalex +2 more sources
On some subclasses of interval catch digraphs
Electronic Journal of Graph Theory and Applications, 2022 A digraph G = (V, E) is an interval catch digraph if for each vertex v ∈ V, one can associate an interval on real line and a point within it (say (Iv, pv)) in such a way that uv ∈ E if and only if pv ∈ Iu. It was introduced by Maehara in 1984.
Sanchita Paul, Shamik Ghosh
doaj +1 more source
Learning semantic program embeddings with graph interval neural network [PDF]
Proc. ACM Program. Lang., 2020 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