Results 41 to 50 of about 723,682 (282)
Discrete Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. Hobbs, Arthur +2 more
openaire +1 more source
Towards Scalable Visual Exploration of Very Large RDF Graphs
, 2015 In this paper, we outline our work on developing a disk-based infrastructure for efficient visualization and graph exploration operations over very large graphs.
A Dadzie +11 more
core +1 more source
Graphulo: Linear Algebra Graph Kernels for NoSQL Databases
, 2015 Big data and the Internet of Things era continue to challenge computational systems. Several technology solutions such as NoSQL databases have been developed to deal with this challenge.
Bolewski, Jake +5 more
core +1 more source
The total irregularity of graphs under graph operations [PDF]
Miskolc Mathematical Notes, 2014 14 pages, 3 figures, Journal ...
Abdo, H., Dimitrov, D.
openaire +4 more sources
On Divided-Type Connectivity of Graphs
Entropy, 2023 The graph connectivity is a fundamental concept in graph theory. In particular, it plays a vital role in applications related to the modern interconnection graphs, e.g., it can be used to measure the vulnerability of the corresponding graph, and is an ...
Qiao Zhou, Xiaomin Wang, Bing Yao
doaj +1 more source
, 2017 A model of computation that is widely used in the formal analysis of reactive systems is symbolic algorithms. In this model the access to the input graph is restricted to consist of symbolic operations, which are expensive in comparison to the standard ...
Chatterjee, Krishnendu +3 more
core +1 more source
Constructing Adjacency Arrays from Incidence Arrays
, 2017 Graph construction, a fundamental operation in a data processing pipeline, is typically done by multiplying the incidence array representations of a graph, $\mathbf{E}_\mathrm{in}$ and $\mathbf{E}_\mathrm{out}$, to produce an adjacency array of the graph,
Dibert, Karia +2 more
core +1 more source
Typing Graph-Manipulation Operations [PDF]
, 2002 We present a graph-based data model called GDM where database instances and database schemas are described by certain types of labeled graphs called instance graphs and schema graphs. For this data model we introduce two graph-manipulation operations, an addition and a deletion, that are based on pattern matching and can be represented in a graphical ...
openaire +2 more sources
Molecular Oncology, EarlyView.Nanosecond infrared laser (NIRL) low‐volume sampling combined with shotgun lipidomics uncovers distinct lipidome alterations in oropharyngeal squamous cell carcinoma (OPSCC) of the palatine tonsil. Several lipid species consistently differentiate tumor from healthy tissue, highlighting their potential as diagnostic markers.
Leonard Kerkhoff +11 more
wiley +1 more source
Barekeng, 2022 If be a graph and edge coloring of G is a function , rainbow connection number is the minimum-k coloration of the rainbow on the edge of graph G and denoted by rc(G). Rainbow connection numbers can be applied to the result of operations on some special
Sumarno Ismail +3 more
doaj +1 more source