Results 81 to 90 of about 2,283,531 (215)
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Low-degree graph partitioning via local search with applications to constraint satisfaction, max cut, and coloring [PDF]
We present practical algorithms for constructing partitions of graphs into a fixed number of vertex-disjoint subgraphs that satisfy particular degree constraints.
Magnús M. Halldórsson +3 more
core +1 more source
We introduce the concept of a k-dimensional matrix product D of k matrices (Formula presented.) of sizes (Formula presented.) respectively, where (Formula presented.) is equal to (Formula presented.).
Lingas, Andrzej, +2 more
core +1 more source
Distance-Preserving Graph Compression Techniques
We study the problem of distance-preserving graph compression for weighted paths and trees. The problem entails a weighted graph $G = (V, E)$ with non-negative weights and a subset of edges $E^{\prime} \subset E$, which needs to be removed from G (with
Amirali Madani, Anil Maheshwari
doaj +1 more source
GRAph Parallel Actor Language — A Programming Language for Parallel
All Rights Reservediii We introduce a domain-specific language, GRAph PArallel Actor Language, that enables parallel graph algorithms to be written in a natural, high-level form.
Graph Algorithms, Michael Delorimier
core
Slanted Orthogonal Drawings: Model, Algorithms and Evaluations
We introduce a new model in the context of non-planar orthogonal graph drawing that we call slanted orthogonal graph drawing. While in traditional orthogonal drawings each edge is made of alternating axis-aligned line segments, in slanted orthogonal ...
ROSELLI, VINCENZO +5 more
core +1 more source
Graph algorithms for predicting subcellular localization at the pathway level [PDF]
Magnano CS, Gitter A.
europepmc +1 more source
Sublinear Space Graph Algorithms in the Continual Release Model
The graph continual release model of differential privacy seeks to produce differentially private solutions to graph problems under a stream of edge updates where new private solutions are released after each update. Previously known edge differentially
Alessandro Epasto +3 more
doaj +1 more source
Integrating transformer and autoencoder techniques with spectral graph algorithms for the prediction of scarcely labeled molecular data. [PDF]
Hayes N, Merkurjev E, Wei GW.
europepmc +1 more source
Adjacency Maps and Efficient Graph Algorithms
Graph algorithms that test adjacencies are usually implemented with an adjacency-matrix representation because the adjacency test takes constant time with adjacency matrices, but it takes linear time in the degree of the vertices with adjacency lists. In
Gabriel Valiente
core +1 more source

