Results 11 to 20 of about 139,638 (260)

Characterizing DAG-depth of Directed Graphs [PDF]

Electronic Proceedings in Theoretical Computer Science, 2016
We study DAG-depth, a structural depth measure of directed graphs, which naturally extends the tree-depth of ordinary graphs. We define a DAG-depth decomposition as a strategy for the cop player in the lift-free version of the cops-and-robber game on ...
Matúš Bezek
doaj   +1 more source

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs [PDF]

Discrete Mathematics & Theoretical Computer Science
A path graph is the intersection graph of paths in a tree. A directed path graph is the intersection graph of paths in a directed tree. Even if path graphs and directed path graphs are characterized very similarly, their recognition algorithms differ ...
Lorenzo Balzotti
doaj   +1 more source

Open trails in digraphs [PDF]

Opuscula Mathematica, 2011
It has been shown in [S. Cichacz, A. Görlich, Decomposition of complete bipartite graphs into open trails, Preprint MD 022, (2006)] that any bipartite graph \(K_{a,b}\), is decomposable into open trails of prescribed even lengths.
Sylwia Cichacz, Agnieszka Görlich
doaj   +1 more source

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, Lévêque Benjamin, Tondato Silvia B.   +2 more
doaj   +1 more source

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, Peng Yi, Yanqiong Zhang, Dawei Liu   +3 more
doaj   +1 more source

Detours in directed graphs

Journal of Computer and System Sciences, 2023
To appear in STACS ...
Fedor V. Fomin, Petr A. Golovach, William Lochet, Danil Sagunov, Saket Saurabh, Kirill Simonov   +5 more
openaire   +7 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, LOUIS DEBIASIO, THEODORE MOLLA, ANDREW TREGLOWN   +3 more
doaj   +1 more source

Hitting minors, subdivisions, and immersions in tournaments [PDF]

Discrete Mathematics & Theoretical Computer Science, 2018
The Erd\H{o}s-P\'osa property relates parameters of covering and packing of combinatorial structures and has been mostly studied in the setting of undirected graphs.
Jean-Florent Raymond
doaj   +1 more source

Copula Directed Acyclic Graphs [PDF]

SSRN Electronic Journal, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pircalabelu, Eugen, Claeskens, Gerda, Gijbels, Irène   +2 more
openaire   +3 more sources