Radial level planarity testing and embedding in linear time.
Ramanujan grammar and Cayley trees. (Grammaire de Ramanujan et arbres de Cayley.)
Recognizing the -structure of claw-free graphs and a larger graph class.
Recouvrement et partition en chaînes des arêtes d'un graphe cubique
Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs.
Reducing Off-Line to On-Line: an Example and Its Applications
Reducing the adjacency matrix of a tree.
Reverse mathematics of some topics from algorithmic graph theory
This paper analyzes the proof-theoretic strength of an infinite version of several theorems from algorithmic graph theory. In particular, theorems on reachability matrices, shortest path matrices, topological sorting, and minimal spanning trees are considered.
Rewriting on cyclic structures : equivalence between the operational and the categorical description
Rewriting on cyclic structures: Equivalence between the operational and the categorical description
We present a categorical formulation of the rewriting of possibly cyclic term graphs, based on a variation of algebraic 2-theories. We show that this presentation is equivalent to the well-accepted operational definition proposed by Barendregt et al. – but for the case of circular redexes , for which we propose (and justify formally) a different treatment. The categorical framework allows us to model in a concise way also automatic garbage collection and rules for sharing/unsharing and...
Right-cancellability of a family of operations on binary trees.