Results 21 to 30 of about 1,207,649 (297)
Large-girth roots of graphs [PDF]
, 2010 We study the problem of recognizing graph powers and computing roots of graphs. Our focus is on classes of graphs with no short cycles. We provide a polynomial time recognition algorithm for r-th powers of graphs of girth at least 2r vertical bar 3, thus
Adamaszek, Michal +4 more
core +1 more source
Discrete Morse Inequalities on Infinite Graphs [PDF]
The Electronic Journal of Combinatorics, 2009 The goal of this paper is to extend to infinite graphs the known Morse inequalities for discrete Morse functions proved by R. Forman in the finite case. In order to get this result we shall use a special kind of infinite subgraphs on which a discrete Morse function is monotonous, namely, decreasing rays.
Fernández Fernández, Luis Manuel +2 more
openaire +5 more sources
Discrete Knowledge Graph Embedding based on Discrete Optimization
CoRR, 2021 This paper proposes a discrete knowledge graph (KG) embedding (DKGE) method, which projects KG entities and relations into the Hamming space based on a computationally tractable discrete optimization algorithm, to solve the formidable storage and computation cost challenges in traditional continuous graph embedding methods.
Yunqi Li 0003 +6 more
openaire +3 more sources
Graph matching with hierarchical discrete relaxation [PDF]
Pattern Recognition Letters, 1999 Summary: Our aim in this paper is to develop a Bayesian framework for matching hierarchical relational models. Such models are widespread in computer vision. The framework that we adopt for this study is provided by iterative discrete relaxation.
Richard C. Wilson 0001, Edwin R. Hancock
openaire +3 more sources
Discrete Density Comonads and Graph Parameters
, 2022 Game comonads have brought forth a new approach to studying finite model theory categorically. By representing model comparison games semantically as comonads, they allow important logical and combinatorial properties to be exressed in terms of their Eilenberg-Moore coalgebras.
Samson Abramsky +2 more
openaire +4 more sources
, 2023 AbstractThe spectra of metric equilateral metric graphs are essentially determined by the spectra of the normalised or averaging Laplacian matrices associated with the corresponding discrete graphs.
openaire +1 more source
Graph‐like spaces approximated by discrete graphs and applications
Mathematische Nachrichten, 2021 AbstractWe define a distance between energy forms on a graph‐like metric measure space and on a suitable discrete weighted graph using the concept of quasi‐unitary equivalence. We apply this result to metric graphs, graph‐like manifolds (e.g. a small neighbourhood of an embedded metric graph) or pcf self‐similar fractals as metric measure spaces with ...
Post, Olaf, Simmer, Jan
openaire +2 more sources
Discrete Geodesic Distribution-Based Graph Kernel for 3D Point Clouds
Sensors, 2023 In the structural analysis of discrete geometric data, graph kernels have a great track record of performance. Using graph kernel functions provides two significant advantages.
Mehmet Ali Balcı +3 more
doaj +1 more source
Labeled Embedding Of (n, n-2)-Graphs In Their Complements
Discussiones Mathematicae Graph Theory, 2017 Graph packing generally deals with unlabeled graphs. In [4], the authors have introduced a new variant of the graph packing problem, called the labeled packing of a graph. This problem has recently been studied on trees [M.A. Tahraoui, E.
Tahraoui M.-A. +2 more
doaj +1 more source
Cognitive Research, 2019 Visualizing data through graphs can be an effective way to communicate one’s results. A ubiquitous graph and common technique to communicate behavioral data is the bar graph.
Jessica K. Witt
doaj +1 more source