Rectilinear spanning trees versus bounding boxes.
Récurrence des librairies sur un arbre
Recurrence of distributional limits of finite planar graphs.
Recurrence relations and two-dimensional set partitions.
Recurrences and Legendre transform.
Recurrent and transient trees. (Rekurrente und transiente Bäume.)
Recursive algorithm for parity games requires exponential time
This paper presents a new lower bound for the recursive algorithm for solving parity games which is induced by the constructive proof of memoryless determinacy by Zielonka. We outline a family of games of linear size on which the algorithm requires exponential time.
Recursive algorithm for parity games requires exponential time
This paper presents a new lower bound for the recursive algorithm for solving parity games which is induced by the constructive proof of memoryless determinacy by Zielonka. We outline a family of games of linear size on which the algorithm requires exponential time.
Recursive and combinatorial properties of Schubert polynomials.
Recursive constructions for skew resolutions in affine geometries.
Recursive determination of the enumerator for sums of three squares.
Recursive generation of -ary trees.
Recursive generation of simple planar quadrangulations with vertices of degree 3 and 4
We describe how the simple planar quadrangulations with vertices of degree 3 and 4, whose duals are known as octahedrites, can all be obtained from an elementary family of starting graphs by repeatedly applying two expansion operations. This allows for construction of a linear time generator of all graphs in the class with at most a given order, up to isomorphism.
Recursive Methods for Construction of Balanced N-ary Block Designs
2000 Mathematics Subject Classification: Primary 05B05; secondary 62K10.This paper presents a recursive method for the construction of balanced n-ary block designs. This method is based on the analogy between a balanced incomplete binary block design (B.I .E .B) and the set of all distinct linear sub-varieties of the same dimension extracted from a finite projective geometry. If V1 is the first B.I .E .B resulting from this projective geometry, then by regarding any block of V1 as a projective geometry,...
Reduced decompositions of matchings.
Reducibility as a tool to extend the power of approximation algorithms the minimization of boolean expressions
Reducible properties of graphs
Let L be the set of all hereditary and additive properties of graphs. For P₁, P₂ ∈ L, the reducible property R = P₁∘P₂ is defined as follows: G ∈ R if and only if there is a partition V(G) = V₁∪ V₂ of the vertex set of G such that and . The aim of this paper is to investigate the structure of the reducible properties of graphs with emphasis on the uniqueness of the decomposition of a reducible property into irreducible ones.
Reducing a set by subtracting squares.
Reducing the adjacency matrix of a tree.
Reduction and irreducibility for words and tree-words