18306 search results - page 284 / 3662 » Algorithmics in Exponential Time |
191
Voted
AICCSA
2007
IEEE
16 years 1 months ago
2007
IEEE
In the maximum common subgraph (MCS) problem, we are given a pair of graphs and asked to find the largest induced subgraph common to them both. With its plethora of applications,...
183
Voted
ISAAC
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. We consider bicriteria optimization problems and investigate the relationship between two standard approaches to solving them: (i) computing the Pareto curve and (ii) the...
191
click to vote
ISQED
2002
IEEE
15 years 11 months ago
2002
IEEE
With advancing semiconductor technology and exponentially growing design complexities, predictability of design tools becomes an important part of a stable top-down design process...
165
click to vote
STOC
1989
ACM
15 years 10 months ago
1989
ACM
This paper takes the next step in developing the theory of average case complexity initiated by Leonid A Levin. Previous works Levin 84, Gurevich 87, Venkatesan and Levin 88] have...
209
click to vote
CHARME
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. We propose new, tractably (in some cases provably) efficient algorithmic methods for exact (sound and complete) parameterized reasoning about cache coherence protocols. F...