5473 search results - page 646 / 1095 » On the graph isomorphism problem |
177
Voted
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
Optimizing power consumption at high-level is a critical step towards power-efficient digital system designs. This paper addresses the power management problem by scheduling a giv...
156
click to vote
VLDB
1999
ACM
15 years 11 months ago
1999
ACM
We present an external-memory algorithm for computing a minimum-cost edit script between two rooted, ordered, labeled trees. The I/O, RAM, and CPU costs of our algorithm are, resp...
165
click to vote
CAV
2006
Springer
15 years 10 months ago
2006
Springer
We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...
157
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
158
click to vote
ICALP
1995
Springer
15 years 10 months ago
1995
Springer
We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be efï...