The term combinatorial Gray code was introduced in 1980 to refer to any method for
generating combinatorial objects so that successive objects differ in some prespecified …

In representing a subset of a large finite set, or an index for text search, one is faced with the
need for both time and space efficiency. In this paper, we look at some approaches that have …

The notion of graph which is most useful in computer science is that of a directed graph or
just a graph. A graph is a combinatorial structure consisting of a finite nonempty set of …

Книга содержит систематическое и полное изложение фундаментальных основ
современных компьютерных технологий, связанных с применением теории графов …

Humanity has long enjoyed making lists. All children delight in their new-found ability to
count 1, 2, 3, etc., and it is a profound revelation that this process can be carried out …

This monograph is based on a series of ten lectures that I gave at the CBMS-NSF
Conference on Selection Algorithms for Combinatorial Objects, held in the summer of 1987 …

This paper generalizes a result of Ruskey [SIAM J. Comput., 7 (1978), pp. 424–439] for
generating k-ary trees lexicographically to generating all rooted trees with n vertices. An …

The rotation graph, G n, has vertex set consisting of all binary trees with n nodes. Two
vertices are connected by an edge if a single rotation will transform one tree into the other …

Федеральные образовательные стандарты накладывают жесткие условия на
организацию обучения бакалавров и магистров и на учебно-методическую и научную …

Nodes in the wireless sensor networks are battery operated, and thus, the efficient use of the
node's energy during wireless communication is pivotal for the long battery life. This paper …