Results 41 to 50 of about 70,417 (125)

On rooted directed path graphs

, 2016
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.
Tondato, Silvia Beatriz, Gutiérrez, Marisa   +1 more
openaire   +2 more sources

Local algorithms in (weakly) coloured graphs [PDF]

, 2010
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum dominating set problem and the maximum matching problem in 2-coloured and ...
Polishchuk, Valentin, Rybicki, Joel, Suomela, Jukka, Uitto, Jara, Åstrand, Matti   +4 more
core  

Oriented coloring on recursively defined digraphs

, 2019
Coloring is one of the most famous problems in graph theory. The coloring problem on undirected graphs has been well studied, whereas there are very few results for coloring problems on directed graphs. An oriented k-coloring of an oriented graph G=(V,A)
Gurski, Frank, Komander, Dominique, Rehs, Carolin   +2 more
core   +1 more source

On Modal {\mu}-Calculus over Finite Graphs with Bounded Strongly Connected Components

, 2010
For every positive integer k we consider the class SCCk of all finite graphs whose strongly connected components have size at most k. We show that for every k, the Modal mu-Calculus fixpoint hierarchy on SCCk collapses to the level Delta2, but not to ...
Angelo Montanari, Giacomo Lenzi, Giovanna D'Agostino, Margherita Napoli, Mimmo Parente   +4 more
core   +2 more sources

Join-Reachability Problems in Directed Graphs [PDF]

, 2010
For a given collection G of directed graphs we define the join-reachability graph of G, denoted by J(G), as the directed graph that, for any pair of vertices a and b, contains a path from a to b if and only if such a path exists in all graphs of G.
Georgiadis, Loukas, Nikolopoulos, Stavros D., Palios, Leonidas   +2 more
core  

Asymptotic expansion of the multi-orientable random tensor model

, 2015
Three-dimensional random tensor models are a natural generalization of the celebrated matrix models. The associated tensor graphs, or 3D maps, can be classified with respect to a particular integer or half-integer, the degree of the respective graph.
Fusy, Eric, Tanasa, Adrian
core   +1 more source

Semi-automatic geometrical reconstruction and analysis of filopodia dynamics in 4D two-photon microscopy images. [PDF]

BMC Bioinformatics
Brence B, Brummer J, Dercksen VJ, Özel MN, Kulkarni A, Wolterhoff N, Prohaska S, Hiesinger PR, Baum D.   +8 more
europepmc   +3 more sources

Characterizing semi-directed phylogenetic networks and their multi-rootable variants. [PDF]

Theory Biosci
Holtgrefe N, Huber KT, van Iersel L, Jones M, Moulton V.   +4 more
europepmc   +1 more source

The Firefighter problem with dynamic defence costs. [PDF]

PLoS One
Hunter E, Enright J.
europepmc   +1 more source

Algebraic formulas for first-passage times of Markov processes in the linear framework. [PDF]

Bull Math Biol
Nam KM, Gunawardena J.
europepmc   +1 more source