Implicit graph representations are immutable data structures for restricted classes of graphs such as planar graphs. A graph class has an implicit representation if the vertices of every graph in this class can be assigned ...

A labeling scheme is a space-efficient data structure for encoding graphs from a particular class. The idea is to assign each vertex of a graph a short label s.t. adjacency of two vertices can be determined by feeding their ...

We describe an approach to teaching algorithmic thinking and programming and the first experiences that we made with it in practice. The idea is to present computational problems as a certain kind of game that the learner ...