Regular interval timetable in Hungary

Timetable

Interval Colourings of Some Regular Graphs

Let G = (V,E) be an undirected graph without loops and multiple edges [1], V (G) and E(G) be the sets of vertices and edges of G, respectively. The degree of a vertex x ∈ V (G) is denoted by dG(x), the maximum degree of a vertex of G-by ∆(G), and the chromatic index [2] of G-by χ(G). A graph is regular, if all its vertices have the same degree. If α is a proper edge colouring of the graph G [3]...

Temporal dynamics of pitch strength in regular interval noises.

The pitch strength of rippled noise and iterated rippled noise has recently been fitted by an exponential function of the height of the first peak in the normalized autocorrelation function [Yost, J. Acoust. Soc. Am. 100, 3329-3335 (1996)]. The current study compares the pitch strengths and autocorrelation functions of rippled noise (RN) and another regular-interval noise, "AABB." RN is generat...

Recoverable Robust Timetable Information

Timetable information is the process of determining a suitable travel route for a passenger. Due to delays in the original timetable, in practice it often happens that the travel route cannot be used as originally planned. For a passenger being already en route, it would hence be useful to know about alternatives that ensure that his/her destination can be reached. In this work we propose a rec...

Automatic Timetable Generation System

This paper discusses the various approaches that can be taken to solve the timetable generation problem. Timetable generation is basically a constraint satisfaction problem. The methods discussed in this paper are capable of handling both soft and hard constraints. Once the final timetable has been generated, teachers and students can access it through three different views i.e., class view, la...