Given a directed graph G, the K node-disjoint paths problem consists in finding a partition of G into K node-disjoint paths, such that each path ends up in a given subset of nodes...
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...
We show that to each graceful labelling of a path on 2s + 1 vertices, s ≥ 2, there corresponds a current assignment on a 3-valent graph which generates at least 22s cyclic orien...
Luis A. Goddyn, R. Bruce Richter, Jozef Sirá...
This paper considers the rate optimal VLSI design of a recursive data flow graph (DFG). Previous research on rate optimal scheduling is not directly applicable to VLSI design. We ...