5606 search results - page 410 / 1122 » Randomization Techniques for Graphs. |
156
click to vote
AAIM
2008
Springer
16 years 1 months ago
2008
Springer
A promising approach to compare two graph clusterings is based on using measurements for calculating the distance between them. Existing measures either use the structure of cluste...
196
click to vote
HICSS
2007
IEEE
16 years 1 months ago
2007
IEEE
This paper presents a graph transformation based approach to design pattern evolution. An evolution of a design pattern includes modifications of pattern elements, such as classes...
147
click to vote
COCO
2007
Springer
16 years 27 days ago
2007
Springer
We consider the problem of counting the number of spanning trees in planar graphs. We prove tight bounds on the complexity of the problem, both in general and especially in the mo...
172
click to vote
GD
2004
Springer
16 years 3 days ago
2004
Springer
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...
201
click to vote
ICPADS
1998
IEEE
15 years 11 months ago
1998
IEEE
The DAG-based task graph model has been found effective in scheduling for performance prediction and optimization of parallel applications. However the scheduling complexity and s...