5473 search results - page 681 / 1095 » On the graph isomorphism problem |
173
click to vote
FOCS
2006
IEEE
16 years 26 days ago
2006
IEEE
Lossless condensers are unbalanced expander graphs, with expansion close to optimal. Equivalently, they may be viewed as functions that use a short random seed to map a source on ...
188
click to vote
ICDCS
2006
IEEE
16 years 26 days ago
2006
IEEE
In this paper, we study distributed approximation algorithms for fault-tolerant clustering in wireless ad hoc and sensor networks. A k-fold dominating set of a graph G = (V, E) is...
195
click to vote
ASPDAC
2006
ACM
16 years 23 days ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...
197
click to vote
VALUETOOLS
2006
ACM
16 years 23 days ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
236
click to vote
BIBE
2005
IEEE
16 years 13 days ago
2005
IEEE
In this article we present novel preprocessing techniques, based on topological measures of the network, to identify clusters of proteins from Protein-protein interaction (PPI) ne...