Results 21 to 30 of about 70,417 (125)
A general approach to solving problems on graphs by collective automata
Труды Института системного программирования РАН, 2018 We propose a general method to solve graph problems by a set of automata (computational agents) located in vertices of undirected ordered connected rooted graph and communicating by passing messages along graph edges.
I. B. Burdonov, A. S. Kossatchev
doaj +1 more source
An FPT Algorithm for Directed Spanning k-Leaf [PDF]
, 2007 An out-branching of a directed graph is a rooted spanning tree with all arcs directed outwards from the root. We consider the problem of deciding whether a given directed graph D has an out-branching with at least k leaves (Directed Spanning k-Leaf).
Frederic Dorn +2 more
core +3 more sources
Efficiently listing bounded length st-paths [PDF]
, 2014 The problem of listing the $K$ shortest simple (loopless) $st$-paths in a graph has been studied since the early 1960s. For a non-negatively weighted graph with $n$ vertices and $m$ edges, the most efficient solution is an $O(K(mn + n^2 \log n ...
Rizzi, Romeo +2 more
core +2 more sources
Graphs and their associated inverse semigroups [PDF]
Discrete Mathematics, 2015 Directed graphs have long been used to gain understanding of the structure of semigroups, and recently the structure of directed graph semigroups has been investigated resulting in a characterization theorem and an analog of Fruct's Theorem.
Tien Chih, Demitri Plessas
semanticscholar +1 more source
Log-space Algorithms for Paths and Matchings in k-trees [PDF]
, 2010 Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [JT07]. However, for graphs of tree-width larger than 2, no bound better than NL is known.
Das, Bireswar +2 more
core +3 more sources
Asteroidal quadruples in non rooted path graphs [PDF]
, 2019 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.
Gutiérrez, Marisa +2 more
core +3 more sources
Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs [PDF]
, 2019 We give new partially-dynamic algorithms for the all-pairs shortest paths problem in weighted directed graphs. Most importantly, we give a new deterministic incremental algorithm for the problem that handles updates in O~(mn^(4/3) log{W}/epsilon) total ...
Karczmarz, Adam, Lacki, Jakub
core +2 more sources
IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021 In this paper, we present novel strategies for optimizing the performance of many binary image processing algorithms. These strategies are collected in an open-source framework, graphgen, that is able to automatically generate optimized C++ source code ...
Federico Bolelli +2 more
semanticscholar +1 more source
Coloring triangle-free rectangle overlap graphs with $O(\log\log n)$ colors [PDF]
, 2014 Recently, it was proved that triangle-free intersection graphs of $n$ line segments in the plane can have chromatic number as large as $\Theta(\log\log n)$.
Krawczyk, Tomasz +2 more
core +4 more sources
Steinitz Theorems for Orthogonal Polyhedra [PDF]
, 2009 We define a simple orthogonal polyhedron to be a three-dimensional polyhedron with the topology of a sphere in which three mutually-perpendicular edges meet at each vertex.
Eppstein, David, Mumford, Elena
core +3 more sources