12 search results - page 3 / 3 » Maximum Flows and Parametric Shortest Paths in Planar Graphs |
IDA
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. We propose a generic framework and methods for simplification of large networks. The methods can be used to improve the understandability of a given network, to complemen...
DATE
2006
IEEE
13 years 10 months ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...