Results 41 to 50 of about 841,611 (282)
A Hierarchical Parallel Graph Summarization Approach Based on Ranking Nodes
Applied Sciences, 2023 Graph summarization techniques are vital in simplifying and extracting enormous quantities of graph data. Traditional static graph structure-based summarization algorithms generally follow a minimum description length (MDL) style, and concentrate on ...
Qiang Liu, Jiaxing Wei, Hao Liu, Yimu Ji
doaj +1 more source
Deeper Exploiting Graph Structure Information by Discrete Ricci Curvature in a Graph Transformer
Entropy, 2023 Graph-structured data, operating as an abstraction of data containing nodes and interactions between nodes, is pervasive in the real world. There are numerous ways dedicated to extract graph structure information explicitly or implicitly, but whether it ...
Xin Lai +4 more
doaj +1 more source
Jurnal Paedagogy, 2023 This study aims to analyze the effect of the 5E learning cycle model assisted by LKPD based on a three-dimensional thinking graph on scientific reasoning and the improvement of scientific reasoning.
Hamidita Putri Ristia +2 more
doaj +1 more source
Leader Election for Anonymous Asynchronous Agents in Arbitrary Networks [PDF]
, 2012 We study the problem of leader election among mobile agents operating in an arbitrary network modeled as an undirected graph. Nodes of the network are unlabeled and all agents are identical.
Dereniowski, Dariusz, Pelc, Andrzej
core +2 more sources
Symmetry in complex unit gain graphs and their spectra
Linear Algebra and its ApplicationsComplex unit gain graphs may exhibit various kinds of symmetry. In this work, we explore structural symmetry, spectral symmetry and sign-symmetry in such graphs, and their respective relations to one-another. Our main result is a construction that transforms an arbitrary complex unit gain graph into infinitely many switching-distinct ones whose ...
Pepijn Wissing, Edwin van Dam
openalex +3 more sources
Feature-Enhanced Latent Summarization Model of Heterogeneous Network [PDF]
Jisuanji kexue yu tansuo, 2022 With the rapid growth of network data, large-scale heterogeneous network data storage and network repre-sentation have become hot research topics. This paper proposes two different tasks, generating graph summarization and generating node representations
XU Zhengxiang, WANG Ying, WANG Hongji, WANG Xin
doaj +1 more source
Bayesian graph edit distance [PDF]
, 2000 This paper describes a novel framework for comparing and matching corrupted relational graphs. The paper develops the idea of edit-distance originally introduced for graph-matching by Sanfeliu and Fu [1].
Hancock, E.R., Myers, R., Wilson, R.C.
core +1 more source
IEEE Access, 2023 Graph summarization is the problem of producing smaller graph representations of an input graph dataset, in such a way that the smaller compressed graphs capture relevant structural information for downstream tasks.
Sepideh Neshatfar +2 more
doaj +1 more source
Interconnected Observers for Robust Decentralized Estimation with Performance Guarantees and Optimized Connectivity Graph [PDF]
, 2015 Motivated by the need of observers that are both robust to disturbances and guarantee fast convergence to zero of the estimation error, we propose an observer for linear time-invariant systems with noisy output that consists of the combination of N ...
Li, Yuchun, Sanfelice, Ricardo G.
core +1 more source
Balance in gain graphs – A spectral analysis
Linear Algebra and its Applications, 2012 AbstractA gain graph is a graph where the edges are given some orientation and labeled with the elements (called gains) from a group so that gains are inverted when we reverse the direction of the edges. A signed graph with labels from the multiplicative group {1,-1} on the edges can be taken as a particular case of a gain graph.
K. A. Germina, Shahul Hameed K
openaire +2 more sources