Results 21 to 30 of about 16,499 (231)
AsySPA: An Exact Asynchronous Algorithm for Convex Optimization Over Digraphs [PDF]
IEEE Transactions on Automatic Control, 2018 This paper proposes a novel exact asynchronous subgradient-push algorithm (AsySPA) to solve an additive cost optimization problem over digraphs where each node only has access to a local convex function and updates asynchronously with an arbitrary rate ...
Jiaqi Zhang, Keyou You
semanticscholar +1 more source
Theoretical Computer Science, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Daniel Meister 0001, Jan Arne Telle
openaire +1 more source
Double vertex digraphs of digraphs
Discrete Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yubin Gao, Yanling Shao
openaire +1 more source
Quantum walks defined by digraphs and generalized Hermitian adjacency matrices [PDF]
Quantum Information Processing, 2019 We propose a quantum walk defined by digraphs (mixed graphs). This is like Grover walk that is perturbed by a certain complex-valued function defined by digraphs.
Sho Kubota, E. Segawa, T. Taniguchi
semanticscholar +1 more source
The Roman Domatic Problem in Graphs and Digraphs: A Survey
Discussiones Mathematicae Graph Theory, 2020 In this paper, we survey results on the Roman domatic number and its variants in both graphs and digraphs. This fifth survey completes our works on Roman domination and its variations published in two book chapters and two other surveys.
M. Chellali +3 more
semanticscholar +1 more source
Hajós and Ore Constructions for Digraphs [PDF]
Electronic Journal of Combinatorics, 2019 The dichromatic number $\overrightarrow{\chi}(D)$ of a digraph $D$ is the minimum number of colors needed to color the vertices of $D$ such that each color class induces an acyclic subdigraph of $D$. A digraph $D$ is $k$-critical if $\overrightarrow{\chi}
J. Bang-Jensen +3 more
semanticscholar +1 more source
The negative tetrahedron and the first infinite family of connected digraphs that are strongly determined by the Hermitian spectrum [PDF]
Journal of Combinatorial Theory, 2019 Thus far, digraphs that are uniquely determined by their Hermitian spectra have proven elusive. Instead, researchers have turned to spectral determination of classes of switching equivalent digraphs, rather than individual digraphs. In the present paper,
P. Wissing, E. V. Dam
semanticscholar +1 more source
Journal of Combinatorial Theory, Series B, 1993 We introduce a generalization of digraphs that are local tournaments. This is the class of in-tournament digraphs---the set of predecessors of every vertex induces a tournament. We show that many properties of local tournament digraphs can be extended even to in-tournament digraphs.
Jørgen Bang-Jensen +2 more
openaire +1 more source
Some Remarks On The Structure Of Strong K-Transitive Digraphs
Discussiones Mathematicae Graph Theory, 2014 A digraph D is k-transitive if the existence of a directed path (v0, v1, . . . , vk), of length k implies that (v0, vk) ∈ A(D). Clearly, a 2-transitive digraph is a transitive digraph in the usual sense.
Hernández-Cruz César +1 more
doaj +1 more source
IEEE Access, 2020 Many real-world networks consisting of nodes representing (in)tangible asymmetric information or energy flows must be modeled as directed graphs (digraphs).
Chung-Yuan Huang, Wei Chien Benny Chin
doaj +1 more source