Results 51 to 60 of about 449,987 (313)
RAG: RNA-As-Graphs web resource
Background The proliferation of structural and functional studies of RNA has revealed an increasing range of RNA's structural repertoire. Toward the objective of systematic cataloguing of RNA's structural repertoire, we have recently described the basis ...
Laserson Uri+6 more
doaj +1 more source
In order to detect multi-ship encounter situations and improve the safety of navigation, this paper proposed a model which was able to mine multi-ship encounter situations from Automatic identification system (AIS) data and analyze the encounter spatial ...
Jixiang Zhu+4 more
doaj +1 more source
Chip-firing games on Eulerian digraphs and NP-hardness of computing the rank of a divisor on a graph
Baker and Norine introduced a graph-theoretic analogue of the Riemann-Roch theory. A central notion in this theory is the rank of a divisor. In this paper we prove that computing the rank of a divisor on a graph is NP-hard.
Kiss, Viktor, Tóthmérész, Lilla
core +1 more source
Covering of Subspaces by Subspaces [PDF]
Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph $\cG_q(n,r)$ by subspaces from the Grassmann graph $\cG_q(n,k)$, $k \geq r$, are discussed.
Etzion, Tuvi
core +1 more source
The objective of this study was to characterize network-level changes in nonfluent/agrammatic Primary Progressive Aphasia (agPPA) and Primary Progressive Apraxia of Speech (PPAOS) with graph theory (GT) measures derived from scalp electroencephalography (
Rene L. Utianski+7 more
doaj +1 more source
Graph Spectral Properties of Deterministic Finite Automata
We prove that a minimal automaton has a minimal adjacency matrix rank and a minimal adjacency matrix nullity using equitable partition (from graph spectra theory) and Nerode partition (from automata theory). This result naturally introduces the notion of
A. Goldberg+5 more
core +1 more source
Who is the best player ever? A complex network analysis of the history of professional tennis. [PDF]
We considered all matches played by professional tennis players between 1968 and 2010, and, on the basis of this data set, constructed a directed and weighted network of contacts.
Filippo Radicchi
doaj +1 more source
Wavelets and graph $C^*$-algebras
Here we give an overview on the connection between wavelet theory and representation theory for graph $C^{\ast}$-algebras, including the higher-rank graph $C^*$-algebras of A. Kumjian and D. Pask.
A. Jonsson+39 more
core +1 more source
A Tight Lower Bound on the Controllability of Networks with Multiple Leaders [PDF]
In this paper we study the controllability of networked systems with static network topologies using tools from algebraic graph theory. Each agent in the network acts in a decentralized fashion by updating its state in accordance with a nearest-neighbor ...
Abbas, Waseem+2 more
core +2 more sources
Application of graph theory to the morphological analysis of settlements
In the following paper, the analyses of morphology of settlements were conducted using graph methods. The intention of the author was to create a quantifiable and simple measure, which, in a quantitative way, would express the degree of development of a ...
Szmytkie Robert
semanticscholar +2 more sources