An n-bit (cyclic) Gray code is a (cyclic) sequence of all n-bit strings such that consecutive strings differ in a single bit. We describe an algorithm which for every positive integer n constructs an n-bit cyclic Gray code whose graph of transitions is the d-dimensional hypercube Qd if n = 2, or a subgraph of Qd if 2 d−1 < n < 2. This allows to compress sequences that follow this code so that o...

Abstract. A level graph is a directed acyclic graph with a level assignment for each node. Such graphs play a prominent role in graph drawing. They express strict dependencies and occur in many areas, e. g., in scheduling problems and program inheritance structures. In this paper we extend level graphs to cyclic level graphs. Such graphs occur as repeating processes in cyclic scheduling, visual...

Cyclic orders of graphs and their equivalence have been promoted by Bessy and Thomassés recent proof of Gallai’s conjecture. We explore this notion further : we prove that two cyclic orders are equivalent if and only if the winding number of every circuit is the same in the two. The proof is short and provides a good characterization and a polynomial algorithm for deciding whether two orders ar...

Accurate electric load forecasting has become the most important issue in energy management; however, electric load demonstrates a seasonal/cyclic tendency from economic activities or the cyclic nature of climate. The applications of the support vector regression (SVR) model to deal with seasonal/cyclic electric load forecasting have not been widely explored. The purpose of this paper is to pre...