1127 search results - page 67 / 226 » Testing the Expansion of a Graph |
IPPS
1998
IEEE
15 years 2 months ago
1998
IEEE
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biol...
105
click to vote
JOT
2010
14 years 8 months ago
2010
Abstract We propose a dependence-based representation for object-oriented programs, named Call-based Object-Oriented System Dependence Graph (COSDG). Apart from structural features...
SOFSEM
2010
Springer
15 years 6 months ago
2010
Springer
We study Vector Addition Systems with States (VASS) extended in such a way that one of the manipulated integer variables can be tested to zero. For this class of system, it has bee...
SIAMDM
2002
14 years 9 months ago
2002
Let G be a graph on n vertices and suppose that at least n2 edges have to be deleted from it to make it k-colorable. It is shown that in this case most induced subgraphs of G on c...
ICSE
2000
IEEE-ACM
15 years 1 months ago
2000
IEEE-ACM
Well engineered Web based courseware and exercises provide flexibility and added value to the students, which goes beyond the traditional text book or CD-ROM based courses. The Mu...