9532 search results - page 304 / 1907 » Logic, Graphs, and Algorithms |
182
click to vote
SIROCCO
2001
15 years 8 months ago
2001
This paper considers the design of a survivable WDM network based on covering the initial network with sub-networks, which are protected independently from each other. We focus on...
189
click to vote
TOG
2008
15 years 6 months ago
2008
This paper addresses the problem of interactively modeling large street networks. We introduce a modeling framework that uses tensor fields to guide the generation of a street gra...
175
click to vote
TCAD
1998
15 years 6 months ago
1998
Most existing tools for the synthesisof asynchronouscircuits from Signal Transition Graphs (STGs) derive the reachability graph for the calculation of logic equations. This paper ...
165
click to vote
WADS
2007
Springer
16 years 23 days ago
2007
Springer
Distance oracles and graph spanners are excerpts of a graph that allow to compute approximate shortest paths. Here, we consider the situation where it is possible to access the ori...
164
click to vote
WEA
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...