of MFCS 2002. Springer, Lecture Notes in Comput. Sci. 2420 (2002) 131-142.Bollig, B. and Woelfel, P. (2005). A lower bound technique for nondeterministic graph-driven read-once branching programs and its applic
In: 36th ACM Symposium on the Theory of Computing (STOC), pp. 222–231 (2004) Google Scholar Aubanel, E.: Resource-aware load balancing of parallel applications. In: Udoh, E., Wang, F.Z. (eds.) Handbook of Research on Grid Technologies and Utility Computing: Concepts for Managing ...
View in ScopusGoogle Scholar [2] I. Adler, G. Gottlob, M. Grohe, Hypertree-width and related hypergraph invariants, in 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb’05), in: Discrete Mathematics and Theoretical Computer Science, 2005, pp. 5–10 Google Sch...
During the last years, a wide range of huge networks has been made available to researchers. The discovery of natural groups, a task called graph clustering, in such datasets is a challenge arising in many applications such as the analysis of neural, soc
Sets of finite graphs (and hypergraphs) can be defined in different ways : by context-free grammars, by conguences, by logical formulas. We compare these three types of definitions. In particular, we consider certain context-free graph-grammar, the parsing of which can be expressed in monadic...
[38]. Given this transformation, models in DSLs developed in e-Motions, may be “simulated” in accordance to the given semantics. Since the resulting specification is a valid theory in rewriting logic, Maude’s formal tools, as its reachability analysis tool or its model checker, may be ...