1538 search results - page 34 / 308 » Spectral Techniques in Graph Algorithms |
111
click to vote
CODES
2005
IEEE
15 years 7 months ago
2005
IEEE
This paper proposes a new efficient buffer management technique called shift buffering for automatic code synthesis from synchronous dataflow graphs (SDF). Two previous buffer man...
114
click to vote
SWAT
1994
Springer
15 years 5 months ago
1994
Springer
We present sequential and parallel algorithms for various embedding problems on bounded degree partial k-trees and k-connected partial k-trees these include subgraph isomorphism a...
FCT
2005
Springer
15 years 6 months ago
2005
Springer
Graph homomorphism, also called H-coloring, is a natural generalization of graph coloring: There is a homomorphism from a graph G to a complete graph on k vertices if and only if ...
108
click to vote
CORR
2010
Springer
14 years 12 months ago
2010
Springer
The study of evolution of networks has received increased interest with the recent discovery that many real-world networks possess many things in common, in particular the manner ...
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...