Let G=(V, E) be an n-vertices m-edges directed graph. Let s∈ V be any designated source
vertex. We address the problem of single source reachability (SSR) from s in presence of …

Abstract Let G=(V, E) be an n-vertices m-edges directed graph. Let s inV be any designated
source vertex. We address the problem of reporting the reachability information from s under …

Let G be a directed graph with n vertices, m edges, and a designated source vertex s. We
address the problem of single-source reachability (SSR) from s in the presence of failures of …

In this paper we address the problem of computing a sparse subgraph of any weighted
directed graph such that the exact distances from a designated source vertex to all other …

Most of the logic synthesis algorithms are not scalable for large networks and, for this
reason, partitioning is often applied. However traditional mincut-based partitioning …

BACKGROUND For many years, the performance of digital machine designs has been
evaluated by performing static timing analy sis on the designs. Timing analysis is a design …

A Polynomial Time Flow for Implementing Free Choice Petri-Nets Page 1 LOGIC SYNTHESIS
OF CONCURRENT CONTROLLER SPECIFICATIONS PAVLOS M. MATTHEAKIS …

In this paper we address the problem of computing a sparse subgraph of a weighted
directed graph such that the exact distances from a designated source vertex to all other …

Single source reachability, shortest paths, strong connectivity, etc. are some of the most
fundamental problems in graph algorithms. In the static setting each of these problems can …

Dominators provide a general mechanism for identifying reconverging paths in graphs. This
is useful for a number of applications in Computer-Aided Design (CAD) including signal …