Results 41 to 50 of about 2,163,558 (289)
A graph rewriting programming language for graph drawing [PDF]
, 1998 This paper describes Grrr, a prototype visual graph drawing tool. Previously there were no visual languages for programming graph drawing algorithms despite the inherently visual nature of the process.
Rodgers, Peter
core +1 more source
Balance in gain graphs – A spectral analysis
Linear Algebra and its Applications, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shahul Hameed K, , Germina, K.A.
openaire +1 more source
On the Characteristic Polynomial of Skew Gain Graphs
, 2020 Gain graphs are graphs 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. Generalizing the notion of gain graphs, skew gain graphs have the property that the gain of a reversed edge is the image of edge gain under an anti-involution.
Hameed, K. S. +3 more
openaire +3 more sources
Graph-based implicit knowledge discovery from architecture change logs [PDF]
, 2012 Service architectures continuously evolve as a consequence of frequent business and technical change cycles. Architecture change log data represents a source of evolution-centric information in terms of intent, scope and operationalisation to ...
Pooyan Jamshidi (5276344) +12 more
core +2 more sources
NEPS of complex unit gain graphs
The Electronic Journal of Linear Algebra, 2023 A complex unit gain graph (or $\mathbb T$-gain graph) is a gain graph with gains in $\mathbb T$, the multiplicative group of complex units. Extending a classical construction for simple graphs due to Cvektovic, suitably defined noncomplete extended $p$-sums (NEPS, for short) of $\mathbb T$-gain graphs are considered in this paper. Structural properties
Francesco Belardo +2 more
openaire +3 more sources
The graph grabbing game on {0,1}-weighted graphs
Results in Applied Mathematics, 2019 The graph grabbing game is a two-player game on a weighted connected graph in which two players, Alice and Bob, alternatively remove non-cut vertices one by one to gain the weights on them.
Soogang Eoh, Jihoon Choi
doaj +1 more source
, 2013 In this paper, the concept of Total semirelib graph of a planar graph is introduced. Authors present a characterization of those graphs whose total semirelib graphs are planar, outer planar, Eulerian, hamiltonian with crossing number ...
Prasad, Manjunath +3 more
core +1 more source
Pragmatic Graph Rewriting Modifications [PDF]
, 1999 We present new pragmatic constructs for easing programming in visual graph rewriting programming languages. The first is a modification to the rewriting process for nodes the host graph, where nodes specified as 'Once Only' in the LHS of a rewrite match ...
Rodgers, Peter +3 more
core +1 more source
Enhancing cybersecurity through autonomous knowledge graph construction by integrating heterogeneous data sources [PDF]
PeerJ Computer ScienceCybersecurity plays a critical role in today’s modern human society, and leveraging knowledge graphs can enhance cybersecurity and privacy in the cyberspace.
Hatoon Alharbi +3 more
doaj +2 more sources
, 2012 BACKGROUND AND PURPOSE: Recovery after stroke occurs on the basis of specific molecular events. Genetic polymorphisms associated with impaired neural repair or plasticity might reduce recovery from stroke and might also account for some of the ...
PROCACCIO V +4 more
core +1 more source