Results 11 to 20 of about 264,555 (246)
TechnologiesThis paper investigates the application of graph theory and variants of greedy graph coloring algorithms for the optimization of distributed peer-to-peer networks, with a special focus on private blockchain networks.
Miljenko Švarcmajer +3 more
doaj +2 more sources
Discrete Dynamics in Nature and SocietyWe focus on fault-tolerant consensus for heterogeneous dynamics systems with static and dynamic leaders under input saturation in this article. We apply theory of finite-time stability to multiagent system cooperative control.
Jie Wu, Zijing Li, Xisheng Zhan
doaj +2 more sources
Semantic Foundations of Equality Saturation [PDF]
International Conference on Database TheoryEquality saturation is an emerging technique for program and query optimization developed in the programming language community. It performs term rewriting over an E-graph, a data structure that compactly represents a program space.
Suciu, Dan +2 more
core +2 more sources
Guessing Numbers and Extremal Graph Theory [PDF]
Electronic Journal of Combinatorics, 2020 For a given number of colors, $s$, the guessing number of a graph is the (base $s$) logarithm of the cardinality of the largest family of colorings of the vertex set of the graph such that the color of each vertex can be determined from the colors of the
J. Martin, Puck Rombach
semanticscholar +1 more source
Exact Bounds for Some Hypergraph Saturation Problems [PDF]
, 2014 Let W_n(p,q) denote the minimum number of edges in an n x n bipartite graph G on vertex sets X,Y that satisfies the following condition; one can add the edges between X and Y that do not belong to G one after the other so that whenever a new edge is ...
Moshkovitz, Guy, Shapira, Asaf
core +2 more sources
A general bound for the induced poset saturation problem
European Conference on Combinatorics, Graph Theory and Applications, 2023 For a fixed poset $P$, a family $\mathcal F$ of subsets of $[n]$ is induced $P$-saturated if $\mathcal F$ does not contain an induced copy of $P$, but for every subset $S$ of $[n]$ such that $ S\not \in \mathcal F$, then $P$ is an induced subposet of ...
Andrea Freschi +3 more
semanticscholar +1 more source
Extremal problems for the p-spectral radius of graphs [PDF]
, 2014 The $p$-spectral radius of a graph $G\ $of order $n$ is defined for any real number $p\geq1$ as \[ \lambda^{\left( p\right) }\left( G\right) =\max\left\{ 2\sum_{\{i,j\}\in E\left( G\right) \ }x_{i}x_{j}:x_{1},\ldots,x_{n}\in\mathbb{R}\text{ and }\left ...
Kang, Liying, Nikiforov, Vladimir
core +1 more source
A Unified Ensemble of Concatenated Convolutional Codes [PDF]
, 2017 We introduce a unified ensemble for turbo-like codes (TCs) that contains the four main classes of TCs: parallel concatenated codes, serially concatenated codes, hybrid concatenated codes, and braided convolutional codes.
Amat, Alexandre Graell i +2 more
core +2 more sources
Approaching the Rate-Distortion Limit with Spatial Coupling, Belief propagation and Decimation [PDF]
, 2015 We investigate an encoding scheme for lossy compression of a binary symmetric source based on simple spatially coupled Low-Density Generator-Matrix codes.
Aref, Vahid +2 more
core +2 more sources
Complex, 2018 Graphs can be used to describe a great variety of real-world situations and have therefore been used extensively in different fields. In the present analysis, we use graphs to study the interaction between cerebral function, brain hemodynamics, and ...
Dries Hendrikx +6 more
semanticscholar +1 more source