1538 search results - page 106 / 308 » Spectral Techniques in Graph Algorithms |
DAC
2000
ACM
16 years 2 months ago
2000
ACM
Joint module selection and retiming is a powerful technique to optimize the implementation cost and the speed of a circuit specified using a synchronous data-flow graph (DFG). In ...
155
click to vote
ICALP
2009
Springer
16 years 1 months ago
2009
Springer
We introduce a generic approach for counting subgraphs in a graph. The main idea is to relate counting subgraphs to counting graph homomorphisms. This approach provides new algori...
155
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
101
click to vote
ICPP
1992
IEEE
15 years 5 months ago
1992
IEEE
-- Distributed routing algorithms presented in the literature have tended to be specific to a particular network topology. In order to test the applicability of various routing str...
126
click to vote
IJCAI
2003
15 years 2 months ago
2003
Hyperlink analysis is a successful approach to define algorithms which compute the relevance of a document on the basis of the citation graph. In this paper we propose a technique...