1952 search results - page 163 / 391 » Complete partitions of graphs |
115
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
We give a fully polynomial randomized approximation scheme to compute a lower bound for the matching polynomial of any weighted graph at a positive argument. For the matching poly...
145
click to vote
IEEECIT
2009
IEEE
15 years 11 months ago
2009
IEEE
—Software clustering is a method for increasing software system understanding and maintenance. Software designers, first use MDG graph to model the structure of software system. ...
140
click to vote
ICAIL
2009
ACM
15 years 9 months ago
2009
ACM
We propose an analysis of the codified Law of France as a structured system. Fifty two legal codes are selected on the basis of explicit legal criteria and considered as vertices ...
145
click to vote
JPDC
2007
15 years 4 months ago
2007
Object space (OS) parallelization of an efficient direct volume rendering algorithm for unstructured grids on distributed-memory architectures is investigated. The adaptive OS de...
150
click to vote
ANOR
2004
15 years 4 months ago
2004
We consider the multilevel paradigm and its potential to aid the solution of combinatorial optimisation problems. The multilevel paradigm is a simple one, which at its most basic ...