Fault tolerant subgraph for single source reachability: generic and optimal
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 …
vertex. We address the problem of single source reachability (SSR) from s in presence of …
An optimal dual fault tolerant reachability oracle
K Choudhary - 43rd International Colloquium on Automata …, 2016 - drops.dagstuhl.de
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 …
source vertex. We address the problem of reporting the reachability information from s under …
Fault-tolerant subgraph for single-source reachability: General and optimal
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 …
address the problem of single-source reachability (SSR) from s in the presence of failures of …
[PDF][PDF] Sparse weight tolerant subgraph for single source shortest path
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 …
directed graph such that the exact distances from a designated source vertex to all other …
Timing point selection for a static timing analysis in the presence of interconnect electrical elements
JP Soreff, BL Dorfman, JG Hemmett, R Ledalla… - US Patent …, 2012 - Google Patents
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 …
evaluated by performing static timing analy sis on the designs. Timing analysis is a design …
Dominator-based partitioning for delay optimization
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 …
reason, partitioning is often applied. However traditional mincut-based partitioning …
[PDF][PDF] Logic synthesis of concurrent controller specifications
PM Mattheakis - Ph. D. dissertation, 2013 - csd.uoc.gr
A Polynomial Time Flow for Implementing Free Choice Petri-Nets Page 1 LOGIC SYNTHESIS
OF CONCURRENT CONTROLLER SPECIFICATIONS PAVLOS M. MATTHEAKIS …
OF CONCURRENT CONTROLLER SPECIFICATIONS PAVLOS M. MATTHEAKIS …
Near optimal sized weight tolerant subgraph for single source shortest path
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 …
directed graph such that the exact distances from a designated source vertex to all other …
[PDF][PDF] Compact and Efficient Fault Tolerant Structures for Directed Graphs
K Choudhary - 2017 - cse.iitk.ac.in
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 …
fundamental problems in graph algorithms. In the static setting each of these problems can …
A Linear-Time Algorithm for Finding All Double-Vertex Dominators of a Given Vertex
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 …
is useful for a number of applications in Computer-Aided Design (CAD) including signal …