Results 31 to 40 of about 595,721 (280)
Construction of Directed Assortative Configuration Graphs [PDF]
Constructions of directed configuration graphs based on a given bi-degree distribution were introduced in random graph theory some years ago. These constructions lead to graphs where the degrees of two nodes belonging to the same edge are independent.
Deprez, Philippe, Wüthrich, Mario V.
openaire +3 more sources
Unavoidable Configurations in Complete Topological Graphs [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pach, János +2 more
openaire +2 more sources
Process, Analyze and Visualize Telecommunication Network Configuration Data in Graph Database [PDF]
In network telemetry systems, nodes produce vast number of configuration files based on how they are configured. Steps were taken to process these files into databases to help the work of the developers, testers and customer support to focus on the ...
Péter Lehotay-Kéry, Attila Kiss
doaj +1 more source
Delay Reduction in Multi-Hop Device-to-Device Communication using Network Coding [PDF]
This paper considers the problem of reducing the broadcast decoding delay of wireless networks using instantly decodable network coding (IDNC) based device-to-device (D2D) communications. In a D2D configuration, devices in the network can help hasten the
Al-Naffouri, Tareq Y. +4 more
core +1 more source
On conditional configuration graphs with random distribution of vertex degrees
We consider a configuration graph with N vertices. The degrees of the vertices are drawn independently from a discrete power-law distribution with positive parameter τ . They are equal to the number of each vertex’s numbered semiedges.
Yury Pavlov
doaj +1 more source
The aim of this paper is to give a second survey on relations between graphs and configurations in the sense of the author's first part [Discrete Math. 111, 269-276 (1993; Zbl 0786.05088)]. It contains some further relations as well as additional remarks to topics which were mentioned in the first survey.
openaire +1 more source
Iterative Universal Rigidity [PDF]
A bar framework determined by a finite graph $G$ and configuration $\bf p$ in $d$ space is universally rigid if it is rigid in any ${\mathbb R}^D \supset {\mathbb R}^d$.
Connelly, Robert, Gortler, Steven
core +1 more source
Mission‐centric decision support in cybersecurity via Bayesian Privilege Attack Graph
We present an approach to decision support in cybersecurity with respect to cyber threats and stakeholders' requirements. We approach situations in which cybersecurity experts need to take actions to mitigate the risks, such as temporarily putting an IT ...
Michal Javorník, Martin Husák
doaj +1 more source
Configuration synthesis of electric-drive transmissions for tracked vehicles
This article focus on the configuration synthesis of electric-drive transmissions for tracked vehicles. First, a new graph theory model is proposed to represent the transmission mechanism, which makes the complex transmission system easier to understand.
Ming-Fei Gao, Ji-Bin Hu, Zeng-Xiong Peng
doaj +1 more source
Efficient and exact sampling of simple graphs with given arbitrary degree sequence. [PDF]
Uniform sampling from graphical realizations of a given degree sequence is a fundamental component in simulation-based measurements of network observables, with applications ranging from epidemics, through social networks to Internet modeling.
Charo I Del Genio +3 more
doaj +1 more source

