3678 search results - page 547 / 736 » On the Stable Paths Problem |
203
click to vote
DAC
2005
ACM
16 years 5 months ago
2005
ACM
Pointer analysis, a classic problem in software program analysis, has emerged as an important problem to solve in design automation, at a time when complex designs, specified in t...
216
click to vote
ICDT
2009
ACM
16 years 5 months ago
2009
ACM
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
146
click to vote
VLSID
2002
IEEE
16 years 4 months ago
2002
IEEE
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most...
136
click to vote
ICCD
2006
IEEE
16 years 1 months ago
2006
IEEE
— Accurate estimation of worst-case crosstalk effects is critical for a realistic estimation of the worst-case behavior of deep sub-micron circuits. Crosstalk analysis models usu...
133
click to vote
STACS
2009
Springer
15 years 11 months ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...