5473 search results - page 702 / 1095 » On the graph isomorphism problem |
170
click to vote
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
We propose a post-placement physical synthesis algorithm that can apply multiple circuit synthesis and placement transforms on a placed circuit to improve the critical path delay ...
166
click to vote
EMMCVPR
2009
Springer
16 years 1 months ago
2009
Springer
Optimization with graph cuts became very popular in recent years. As more applications rely on graph cuts, different energy functions are being employed. Recent evaluation of optim...
212
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...
171
Voted
CC
2007
Springer
16 years 29 days ago
2007
Springer
In this paper, we extend past work on Linear Scan register allocation, and propose two Extended Linear Scan (ELS) algorithms that retain the compiletime efficiency of past Linear ...
157
click to vote
SWAT
2004
Springer
16 years 3 days ago
2004
Springer
In this paper, we consider the problems of generating all maximal (bipartite) cliques in a given (bipartite) graph G = (V, E) with n vertices and m edges. We propose two algorithms...