Results 11 to 20 of about 3,234,830 (258)
We prove that the local limit of the minimum spanning arborescence in the complete graph (which is an oriented cousin of the minimum spanning tree in the complete graph) is the same as that of the uniform random tree, oriented towards infinity.
Swarnadeep Bagchi, G. Ray
semanticscholar +3 more sources
Degree-constrained edge partitioning in graphs arising from discrete tomography [PDF]
Starting from the basic problem of reconstructing a 2-dimensional image given by its projections on two axes, one associates a model of edge coloring in a complete bipartite graph. The complexity of the case with k=3 colors is open.
Cedric Bentz +4 more
doaj +2 more sources
Universal Partial Order Represented by Means of Oriented Trees and Other Simple Graphs
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jan Hubička, Jaroslav Nešetřil
exaly +4 more sources
A novel adaptive model-based motion control method for multi-UAV communication relay is proposed, which aims at improving the networks connectivity and the communications performance among a fleet of ground unmanned vehicles.
Cancan Tao, Bowen Liu
doaj +2 more sources
On the Decomposition of Cayley Color Graphs Into Isomorphic Oriented Trees
Let \(\Delta\) be a minimal generating set for a nontrivial group \(\Gamma\) and \(T\) be an oriented tree with \(| \Delta|\) edges. It is shown that the Cayley color graph \(D_ \Delta(\Gamma)\) can be decomposed into \(|\Gamma|\) edge-disjoint subgraphs, each isomorphic to \(T\).
exaly +4 more sources
This paper presents a high-level system architecture that integrates the Software Defined Networking (SDN) paradigm in 5G/6G networks with the aim of supporting the requirements expected for Industrial Internet of Things (IIoT) devices and services.
Francesco Chiti +3 more
doaj +2 more sources
This article describes a curated dataset of structural dependency graphs and object-oriented metrics extracted from 21 open-source Java systems. Each repository was analyzed at a fixed commit using a deterministic AST-based static analysis pipeline.
Marcos Cordeiro de Brito, Jr. +1 more
doaj +2 more sources
Matrix tree theorem for the net Laplacian matrix of a signed graph [PDF]
For a simple signed graph G with the adjacency matrix A and net degree matrix $ D^{\pm } $ D±, the net Laplacian matrix is $ L^{\pm }=D^{\pm }-A $ L±=D±−A.
S. Mallik
semanticscholar +1 more source
On the existence and non-existence of improper homomorphisms of oriented and $2$-edge-coloured graphs to reflexive targets [PDF]
We consider non-trivial homomorphisms to reflexive oriented graphs in which some pair of adjacent vertices have the same image. Using a notion of convexity for oriented graphs, we study those oriented graphs that do not admit such homomorphisms. We fully
Christopher Duffy, Sonja Linghui Shan
doaj +1 more source
GraphDialog: Integrating Graph Knowledge into End-to-End Task-Oriented Dialogue Systems [PDF]
End-to-end task-oriented dialogue systems aim to generate system responses directly from plain text inputs. There are two challenges for such systems: one is how to effectively incorporate external knowledge bases (KBs) into the learning framework; the ...
Shiquan Yang, Rui Zhang, S. Erfani
semanticscholar +1 more source

