Cycles in digraphsâ•fi a survey Page 1 Cycles in DigraphsA Survey JC Bermond UNIVERSITE
PARIS- SUD C. Thomassen ORSAY, FRANCE MATEMATISK INSTITUT. AARHUS …

Let us start with two examples. A company has a machine which drills holes into printed
circuit boards. Since it produces many of these boards it wants the machine to complete one …

The theory of directed graphs has developed enormously over recent decades, yet this book
(first published in 2000) remains the only book to cover more than a small fraction of the …

Xlll. The Disjoint Paths Problem Page 1 oURNAL OF COMBINATORIAL THEORY, Series B 63,
65–110 (1995) Graph Minors. Xlll. The Disjoint Paths Problem NEIL ROBERTSON …

An analysis of the loss in performance caused by selfish, uncoordinated behavior in
networks. Most of us prefer to commute by the shortest route available, without taking into …

Many network problems are based on fundamental relationships involving time. Consider,
for example, the problems of modeling the flow of information through a distributed network …

Let G be a directed graph containing n vertices, one of which is a distinguished source s,
and m edges, each with a non‐negative cost. We consider the problem of finding, for each …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

Computing a (short) path between two vertices is one of the most fundamental primitives in
graph algorithmics. In recent years, the study of paths in temporal graphs, that is, graphs …

We consider the following problem: given a labelled directed graph G and a regular
expression R, find all pairs of nodes connected by a simple path such that the concatenation …