Decidability of equivalence for a class of non-deterministic tree transducers
Deciding soccer scores and partial orientations of graphs.
Dépliage d'un graphe pointé en un cactus
Descendants and ascendants in binary trees.
Description d'une classe de grammaires de graphes sans circuit
Diamètre de graphes et qualité de service d'un réseau de données
Difference metrics for interactive orthogonal graph drawing algorithms.
Digital search trees with keys of variable length
Directed forests with application to algorithms related to Markov chains
This paper is devoted to computational problems related to Markov chains (MC) on a finite state space. We present formulas and bounds for characteristics of MCs using directed forest expansions given by the Matrix Tree Theorem. These results are applied to analysis of direct methods for solving systems of linear equations, aggregation algorithms for nearly completely decomposable MCs and the Markov chain Monte Carlo procedures.
Discussing graph theory with a computer. II: Theorems suggested by the computer.
Discussing Graph Theory with a Computer III, Man-machine Theorem Proving
Disjoint unions of complete graphs characterized by their Laplacian spectrum.
Distributed graph layout for sensor networks.
Domination Game: Extremal Families for the 3/5-Conjecture for Forests
In the domination game on a graph G, the players Dominator and Staller alternately select vertices of G. Each vertex chosen must strictly increase the number of vertices dominated. This process eventually produces a dominating set of G; Dominator aims to minimize the size of this set, while Staller aims to maximize it. The size of the dominating set produced under optimal play is the game domination number of G, denoted by γg(G). Kinnersley, West and Zamani [SIAM J. Discrete Math. 27 (2013) 2090-2107]...
Drawing a graph in a hypercube.
Drawing bipartite graphs on two parallel convex curves.
Drawing clustered graphs on an orthogonal grid.
Drawing graphs on two and three lines.
Drawing graphs within graphs.
Drawing in three dimensions with one bend per edge.