Results 11 to 20 of about 112,189 (262)
Computing the Atom Graph of a Graph and the Union Join Graph of a Hypergraph [PDF]
Algorithms, 2021 The atom graph of a graph is a graph whose vertices are the atoms obtained by clique minimal separator decomposition of this graph, and whose edges are the edges of all possible atom trees of this graph. We provide two efficient algorithms for computing this atom graph, with a complexity in O(min(nωlogn,nm,n(n+m¯)) time, where n is the number of ...
Berry, Anne, Simonet, Geneviève
openaire +6 more sources
On computing the Hamiltonian index of graphs [PDF]
Theoretical Computer Science, 2020 The $r$-th iterated line graph $L^{r}(G)$ of a graph $G$ is defined by: (i) $L^{0}(G) = G$ and (ii) $L^{r}(G) = L(L^{(r- 1)}(G))$ for $r > 0$, where $L(G)$ denotes the line graph of $G$. The Hamiltonian Index $h(G)$ of $G$ is the smallest $r$ such that $L^{r}(G)$ has a Hamiltonian cycle.
Geevarghese Philip +2 more
openaire +6 more sources
CoRR, 2023 Graph neural networks (GNNs) have demonstrated success in modeling relational data, especially for data that exhibits homophily: when a connection between nodes tends to imply that they belong to the same class. However, while this assumption is true in many relevant situations, there are important real-world scenarios that violate this assumption, and
Andreea Deac, Jian Tang 0005
openaire +3 more sources
Annals of Pure and Applied Logic, 2016 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Matthew Jura +2 more
openaire +1 more source
Computational graph completion
Research in the Mathematical Sciences, 2022 34 pages.
openaire +4 more sources
Computational Graphs for Matrix Functions
ACM Transactions on Mathematical Software, 2022 Many numerical methods for evaluating matrix functions can be naturally viewed as computational graphs. Rephrasing these methods as directed acyclic graphs (DAGs) is a particularly effective approach to study existing techniques, improve them, and eventually derive new ones.
Elias Jarlebring +2 more
openaire +4 more sources
Journal of Symbolic Computation, 1997 In his study of Newton's root approximation method, \textit{S. Smale} [Bull. Am. Math. Sco., New Ser. 13, 87-121 (1985; Zbl 0592.65032)] defined the Newtonian graph of a complex univariate polynomial \(f\). The vertices of this graph are the roots of \(f\) and \(f'\) and the edges are the degenerate curves of flow of the Newtonian vector field \(N_f(z)=
Dexter Kozen, Kjartan Stefánsson
openaire +3 more sources
SimRank computation on uncertain graphs [PDF]
2016 IEEE 32nd International Conference on Data Engineering (ICDE), 2016 SimRank is a similarity measure between vertices in a graph, which has become a fundamental technique in graph analytics. Recently, many algorithms have been proposed for efficient evaluation of SimRank similarities. However, the existing SimRank computation algorithms either overlook uncertainty in graph structures or is based on an unreasonable ...
Rong Zhu +2 more
openaire +4 more sources
Research on Maximum Clique Identification Based on Parallel Constraint Programming [PDF]
Jisuanji gongcheng, 2020 To improve the efficiency of solving the Maximum Clique Problem(MCP) of large-scale legends on big data platforms,this paper proposes a maximum clique identification algorithm based on parallel constraint programming.The BMT graph division strategy is ...
XIAO Chenglong, NIE Ziyang, WANG Ning, ZHANG Zhongpeng, WANG Shanshan
doaj +1 more source
Journal of Graph Algorithms and Applications, 2019 The goal of this paper is to introduce some of the important concepts in causal graph theory and examine them from combinatorial and computational perspectives. Of fundamental importance in applications of causal models that use graphs are dependence-separators or, simply, $d$-separators.
Juli Atherton, Derek Ruths, Adrian Vetta
openaire +1 more source