156 search results - page 6 / 32 » The Complexity of the Evolution of Graph Labelings |
AGTIVE
2007
Springer
14 years 1 months ago
2007
Springer
In collaborative ontology engineering, contexts are key to manage the complexity of different dependency types between ontological artefacts. Instead of being frustrated by out-of...
IWDC
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. Despite their crucial impact on the performances of p2p systems, very few is known on peers behaviors in such networks. We propose here a study of these behaviors in a ru...
ECCC
2011
13 years 2 months ago
2011
In recent results the complexity of isomorphism testing on graphs of bounded treewidth is improved to TC1 [GV06] and further to LogCFL [DTW10]. The computation of canonical forms ...
WIOPT
2010
IEEE
13 years 5 months ago
2010
IEEE
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...
SEMCO
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper we present an automated support for software model evolution using a formal language constructs. For this, we extended Object Constraint Language (OCL) with actio...