2063 search results - page 56 / 413 » connection 2007 |
GC
2007
Springer
14 years 10 months ago
2007
Springer
Let G be a connected graph of order n and girth g. If dG(u) + dG(v) ≥ n − 2g + 5 for any two non-adjacent vertices u and v, then G is up-embeddable. Further more, the lower bou...
ICANN
2007
Springer
15 years 5 months ago
2007
Springer
Evolutionary multi-objective optimization of spiking neural networks for solving classification problems is studied in this paper. By means of a Paretobased multi-objective geneti...
FOSSACS
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Separation logic is a recent extension of Hoare logic for reasoning about programs with references to shared mutable data structures. In this paper, we provide a new inte...
115
click to vote
COCOON
2007
Springer
15 years 5 months ago
2007
Springer
We give efficient distributed approximation algorithms for weighted versions of the maximum matching problem and the minimum dominating set problem for graphs from minor-closed fam...
DM
2007
14 years 10 months ago
2007
By a regular embedding of a graph K into a surface we mean a 2-cell embedding of K into a compact connected surface with the automorphism group acting regularly on flags. Regular...