Results 11 to 20 of about 608,783 (278)
Line graphs of directed graphs I [PDF]
Transactions on CombinatoricsWe determine the forbidden induced subgraphs for the intersection of the classes of chordal bipartite graphs and line graphs of acyclic directed graphs. This is a first step towards finding the forbidden induced subgraphs for the class of line graphs of ...
Vaidyanathan Sivaraman, Daniel Slilaty
doaj +4 more sources
Coordination Games on Directed Graphs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We study natural strategic games on directed graphs, which capture the idea of coordination in the absence of globally common strategies. We show that these games do not need to have a pure Nash equilibrium and that the problem of determining their ...
Krzysztof R. Apt +2 more
doaj +1 more source
On the Graph Fourier Transform for Directed Graphs [PDF]
IEEE Journal of Selected Topics in Signal Processing, 2017 To appear in IEEE Journal of Selected Topics in Signal Processing ...
Sardellitti, Stefania +2 more
openaire +2 more sources
Direct reciprocity on graphs [PDF]
Journal of Theoretical Biology, 2007 Direct reciprocity is a mechanism for the evolution of cooperation based on the idea of repeated encounters between the same two individuals. Here we examine direct reciprocity in structured populations, where individuals occupy the vertices of a graph. The edges denote who interacts with whom. The graph represents spatial structure or a social network.
Ohtsuki, Hisashi, Nowak, Martin
openaire +3 more sources
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 ScienceA 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
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
Routing Symmetric Demands in Directed Minor-Free Graphs with Constant Congestion [PDF]
, 2019 The problem of routing in graphs using node-disjoint paths has received a lot of attention and a polylogarithmic approximation algorithm with constant congestion is known for undirected graphs [Chuzhoy and Li 2016] and [Chekuri and Ene 2013].
Carpenter, Timothy +2 more
core +1 more source
CoRR, 2020 The lack of anisotropic kernels in graph neural networks (GNNs) strongly limits their expressiveness, contributing to well-known issues such as over-smoothing. To overcome this limitation, we propose the first globally consistent anisotropic kernels for GNNs, allowing for graph convolutions that are defined according to topologicaly-derived directional
Beaini D. +5 more
openaire +4 more sources
On rooted directed path graphs [PDF]
, 2015 An asteroidal triple is a stable set of three vertices such that each pair is connected by a path avoiding the neighborhood of the third vertex. An asteroidal quadruple is a stable set of four vertices such that any three of them is an asteroidal triple.
Gutierrez, Marisa +1 more
core +2 more sources