Results 21 to 30 of about 1,437,233 (261)
Scalable Graph Convolutional Networks With Fast Localized Spectral Filter for Directed Graphs
IEEE Access, 2020 Graph convolutional neural netwoks (GCNNs) have been emerged to handle graph-structured data in recent years. Most existing GCNNs are either spatial approaches working on neighborhood of each node, or spectral approaches based on graph Laplacian ...
Chensheng Li +4 more
doaj +1 more source
Spektrum Laplace pada graf kincir angin berarah (Q_k^3)
Majalah Ilmiah Matematika dan Statistika, 2022 Suppose that 0 = µ0 ≤ µ1 ≤ ... ≤ µn-1 are eigen values of a Laplacian matrix graph with n vertices and m(µ0), m(µ1), …, m(µn-1) are the multiplicity of each µ, so the Laplacian spectrum of a graph can be expressed as a matrix 2 × n whose line elements ...
Melly Amaliyanah +2 more
doaj +1 more source
A survey of two-dimensional graph layout techniques for information visualisation [PDF]
, 2012 Many algorithms for graph layout have been devised over the last 30 years spanning both the graph drawing and information visualisation communities. This article first reviews the advances made in the field of graph drawing that have then often been ...
Vickers, Paul, Gibson, Helen, Faith, Joe
core +1 more source
Directed Information Graphs [PDF]
IEEE Transactions on Information Theory, 2015 41 pages, 15 ...
Christopher J. Quinn +2 more
openaire +3 more sources
Classifying Higher Rank Toeplitz Operators. [PDF]
, 2007 To a higher rank directed graph (Λ, d), in the sense of Kumjian and Pask, 2000, one can associate natural noncommutative analytic Toeplitz algebras, both weakly closed and norm closed.
Power, S.C.
core +2 more sources
Directed Representative Graph Modeling of MEP Systems Using BIM Data
Buildings, 2022 Mechanical, electrical, and plumbing (MEP) systems are crucial to a building, which directly affect the building safety, energy saving, and operational efficiency.
Junjun Han +5 more
doaj +1 more source
Directed triangles in directed graphs
Discrete Mathematics, 1992 The authors show that if each vertex of an oriented graph \(G_ n\) has indegree and outdegree at least \(n/t\), where \(t=2.867\dots,\) then \(G_ n\) contains an oriented 3-cycle.
Maurits de Graaf +2 more
openaire +4 more sources
Asteroidal Quadruples in non Rooted Path Graphs
Discussiones Mathematicae Graph Theory, 2015 A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are directed path graphs.
Gutierrez Marisa +2 more
doaj +1 more source
Incidence Matrices of Directed Graphs of Groups and their up-down Pregroups
Sultan Qaboos University Journal for Science, 2017 The aim of this work is to give a definition of the incidence matrices of the directed graph of groups, construct an up-down pregroup of the incidence matrices of the directed graph of groups and then give an algorithm for the up-down pregroup of the ...
Wadhah S. Jassim
doaj +1 more source
On Lossy Compression of Directed Graphs [PDF]
IEEE Transactions on Information Theory, 2022 Accepted for publication in IEEE Transactions on Information ...
Ronit Bustin, Ofer Shayevitz
openaire +4 more sources