Results 11 to 20 of about 1,437,233 (261)
A Heuristic for Direct Product Graph Decomposition [PDF]
Journal of Graph Algorithms and Applications, 2023 In this paper we describe a heuristic for decomposing a directed graph into factors according to the direct product (also known as Kronecker, cardinal or tensor product). Given a directed, unweighted graph $G$ with adjacency matrix $\mathbf{Adj}(G)$, our
Luca Calderoni +2 more
doaj +2 more sources
A Multilevel Algorithm for Force-Directed Graph-Drawing
Journal of Graph Algorithms and Applications, 2003 We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a force-directed placement algorithm. The multilevel technique matches and coalesces pairs of adjacent vertices to define a new graph and is repeated ...
Chris Walshaw
doaj +2 more sources
Journal of Computer and System Sciences, 2023 To appear in STACS ...
Fedor V. Fomin +5 more
openaire +9 more sources
Direct reciprocity on graphs [PDF]
Journal of Theoretical Biology, 2007 Direct reciprocity is a mechanism for the evolution of cooperation based on the idea of repeated encounters between the same two individuals. Here we examine direct reciprocity in structured populations, where individuals occupy the vertices of a graph. The edges denote who interacts with whom. The graph represents spatial structure or a social network.
Ohtsuki, Hisashi, Nowak, Martin
openaire +4 more sources
On the Graph Fourier Transform for Directed Graphs [PDF]
IEEE Journal of Selected Topics in Signal Processing, 2017 To appear in IEEE Journal of Selected Topics in Signal Processing ...
Sardellitti, Stefania +2 more
openaire +2 more sources
Directed graph iterated function systems [PDF]
, 2011 This thesis concerns an active research area within fractal geometry. In the first part, in Chapters 2 and 3, for directed graph iterated function systems (IFSs) defined on ℝ, we prove that a class of 2-vertex directed graph IFSs have attractors that ...
Boore, Graeme C.
core +2 more sources
Attractors of directed graph IFSs that are not standard IFS attractors and their Hausdorff measure [PDF]
, 2012 "GCB was supported by an EPSRC Doctoral Training Grant whilst undertaking this work"For directed graph iterated function systems (IFSs) defined on R, we prove that a class of 2-vertex directed graph IFSs have attractors that cannot be the attractors of ...
Boore, Graeme +2 more
core +1 more source
CoRR, 2020 The lack of anisotropic kernels in graph neural networks (GNNs) strongly limits their expressiveness, contributing to well-known issues such as over-smoothing. To overcome this limitation, we propose the first globally consistent anisotropic kernels for GNNs, allowing for graph convolutions that are defined according to topologicaly-derived directional
Beaini D. +5 more
openaire +4 more sources
ionicf/graph-make-undirected: Convert a directed graph to an undirected graph
, 2023 <p>Convert a directed graph to an undirected graph.</p> <pre><code># Convert the web-Stanford directed graph to an undirected graph.
Subhajit Sahu
core +1 more source
On total directed graphs of non-commutative rings
AKCE International Journal of Graphs and Combinatorics, 2017 For a non-commutative ring , the left total directed graph of is a directed graph with vertex set as and for the vertices and , is adjacent to if and only if there is a non-zero which is different from and , such that is a left zero-divisor of .
Kukil Kalpa Rajkhowa, Helen K. Saikia
doaj +1 more source