3958 search results - page 65 / 792 » Dynamic Graph Algorithms with Applications |
138
click to vote
DSD
2006
IEEE
15 years 10 months ago
2006
IEEE
The rising complexity, customization and short time to market of modern digital systems requires automatic methods for generation of high performance architectures for such system...
149
click to vote
ENDM
2008
15 years 4 months ago
2008
A circular-arc graph is the intersection graph of a set of arcs on the circle. It is a Helly circular-arc graph if it has a Helly model, where every maximal clique is the set of a...
149
click to vote
KDD
2005
ACM
16 years 5 months ago
2005
ACM
Graph clustering (also called graph partitioning) -- clustering the nodes of a graph -- is an important problem in diverse data mining applications. Traditional approaches involve...
159
click to vote
EVOW
2006
Springer
15 years 8 months ago
2006
Springer
Many applications involve matching two graphs in order to identify their common features and compute their similarity. In this paper, we address the problem of computing a graph si...
133
click to vote
PPL
2007
15 years 4 months ago
2007
Graph algorithms are becoming increasingly important for solving many problems in scientific computing, data mining and other domains. As these problems grow in scale, parallel c...