Results 1 to 10 of about 55,078 (168)
Faithfulness in chain graphs: The discrete case
International Journal of Approximate Reasoning, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
JOSÉ M Pena
exaly +2 more sources
On the Discrete Fréchet Distance in a Graph [PDF]
CoRR, 2022 The Fréchet distance is a well-studied similarity measure between curves that is widely used throughout computer science. Motivated by applications where curves stem from paths and walks on an underlying graph (such as a road network), we define and study the Fréchet distance for paths and walks on graphs.
Anne Driemel +2 more
openaire +4 more sources
Discrete Optimal Graph Clustering [PDF]
IEEE Transactions on Cybernetics, 2020 Graph based clustering is one of the major clustering methods. Most of it work in three separate steps: similarity graph construction, clustering label relaxing and label discretization with k-means. Such common practice has three disadvantages: 1) the predefined similarity graph is often fixed and may not be optimal for the subsequent clustering.
Yudong Han +4 more
openaire +3 more sources
Fundamental Groupoids for Graphs [PDF]
Categories and General Algebraic Structures with Applications, 2022 In recent years several notions of discrete homotopy for graphs have been introduced, including a notion of ×-homotopy due to Dochtermann. In this paper, we define a ×-homotopy fundamental groupoid for graphs, and prove that it is a functorial ×-homotopy
Tien Chih, Laura Scull
doaj +1 more source
Trans. Mach. Learn. Res., 2023 Thoroughly revised the paper originally titled "Vector-Quantized Graph Auto-Encoder. Implemented comprehensive modifications across all sections. Incorporated additional experiments to enhance the study. Maintained the fundamental structure and essence of the original work, ensuring it remains a continuation of the same ...
Yoann Boget +2 more
openaire +3 more sources
Spatio–Spectral Limiting on Replacements of Tori by Cubes
Mathematics, 2023 A class of graphs is defined in which each vertex of a discrete torus is replaced by a Boolean hypercube in such a way that vertices in a fixed subset of each replacement cube are adjacent to corresponding vertices of a neighboring replacement cube ...
Jeffrey A. Hogan, Joseph D. Lakey
doaj +1 more source
Domination in discrete topology graph [PDF]
AIP Conference Proceedings, 2019 In this paper a graph of the discrete topology under some conditions has been created. It is obtained from the composition of the topologies. The properties and domination number on the discrete topology graph have studied. On a modified graph through deleting or adding the vertex, the affection discrete topological graph domination parameter is ...
Jabor, Ali Ameer, Omran, Ahmed Abd Ali
openaire +2 more sources
Discrete embedding for attributed graphs
Pattern Recognition, 2022 Abstract Attributed graphs refer to graphs where both node links and node attributes are observable for analysis. Attributed graph embedding enables joint representation learning of node links and node attributes. Different from classical graph embedding methods such as Deepwalk and node2vec that first project node links into low-dimensional vectors ...
Hong Yang 0003 +4 more
openaire +2 more sources
Моделирование и анализ информационных систем, 2021 Modern network systems (unmanned aerial vehicles groups, social networks, network production chains, transport and logistics networks, communication networks, cryptocurrency networks) are distinguished by their multi-element nature and the dynamics of ...
Aleksandr Vasil'evich Tymoshenko +2 more
doaj +1 more source
On the use of graphs in discrete tomography [PDF]
Annals of Operations Research, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
de Werra, Dominique +3 more
openaire +5 more sources