Results 21 to 30 of about 608,783 (278)
Algorithmic Applications of Baur-Strassen's Theorem: Shortest Cycles, Diameter and Matchings [PDF]
, 2012 Consider a directed or an undirected graph with integral edge weights from the set [-W, W], that does not contain negative weight cycles. In this paper, we introduce a general framework for solving problems on such graphs using matrix multiplication. The
Cygan, Marek +2 more
core +2 more sources
Directed triangles in directed graphs
Discrete Mathematics, 1992 The authors show that if each vertex of an oriented graph \(G_ n\) has indegree and outdegree at least \(n/t\), where \(t=2.867\dots,\) then \(G_ n\) contains an oriented 3-cycle.
Maurits de Graaf +2 more
openaire +2 more sources
Asteroidal Quadruples in non Rooted Path Graphs
Discussiones Mathematicae Graph Theory, 2015 A directed path graph is the intersection graph of a family of directed subpaths of a directed tree. A rooted path graph is the intersection graph of a family of directed subpaths of a rooted tree. Rooted path graphs are directed path graphs.
Gutierrez Marisa +2 more
doaj +1 more source
On Lossy Compression of Directed Graphs [PDF]
IEEE Transactions on Information Theory, 2022 Accepted for publication in IEEE Transactions on Information ...
Ronit Bustin, Ofer Shayevitz
openaire +2 more sources
Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs [PDF]
, 2010 We develop two different methods to achieve subexponential time parameterized algorithms for problems on sparse directed graphs. We exemplify our approaches with two well studied problems.
Dorn, Frederic +4 more
core +5 more sources
Nash equilibrium seeking over directed graphs
Autonomous Intelligent Systems, 2022 In this paper, we aim to develop distributed continuous-time algorithms over directed graphs to seek the Nash equilibrium in a noncooperative game. Motivated by the recent consensus-based designs, we present a distributed algorithm with a proportional ...
Yutao Tang +3 more
doaj +1 more source
Directed Information Graphs [PDF]
IEEE Transactions on Information Theory, 2015 41 pages, 15 ...
Christopher J. Quinn +2 more
openaire +2 more sources
Tr-Span of Directed Wheel Graphs
Discussiones Mathematicae Graph Theory, 2018 In this paper, we consider T-colorings of directed graphs. In particular, we consider as a T-set the set Tr = {0, 1, 2, . . ., r−1, r+1, . . .}. Exact values and bounds of the Tr-span of directed graphs whose underlying graph is a wheel graph are ...
Besson Marc, Tesman Barry
doaj +1 more source
TILING DIRECTED GRAPHS WITH TOURNAMENTS
Forum of Mathematics, Sigma, 2018 The Hajnal–Szemerédi theorem states that for any positive integer $r$ and any multiple $n$
ANDRZEJ CZYGRINOW +3 more
doaj +1 more source
Absorption Time of the Moran Process [PDF]
, 2014 The Moran process models the spread of mutations in populations on graphs. We investigate the absorption time of the process, which is the time taken for a mutation introduced at a randomly chosen vertex to either spread to the whole population, or to ...
Diaz, Josep +3 more
core +2 more sources