Sciweavers

596 search results - page 52 / 120
» Complexity Analysis by Graph Rewriting
Sort
View
SIAMDM
2008
79views more  SIAMDM 2008»
13 years 8 months ago
Testing Triangle-Freeness in General Graphs
In this paper we consider the problem of testing whether a graph is triangle-free, and more generally, whether it is H-free, for a fixed subgraph H. The algorithm should accept gr...
Noga Alon, Tali Kaufman, Michael Krivelevich, Dana...
FMSB
2008
129views Formal Methods» more  FMSB 2008»
13 years 9 months ago
Rule-Based Modelling, Symmetries, Refinements
Rule-based modelling is particularly effective for handling the highly combinatorial aspects of cellular signalling. The dynamics is described in terms of interactions between part...
Vincent Danos, Jérôme Feret, Walter F...
EDBT
2010
ACM
246views Database» more  EDBT 2010»
14 years 2 months ago
Fast computation of SimRank for static and dynamic information networks
Information networks are ubiquitous in many applications and analysis on such networks has attracted significant attention in the academic communities. One of the most important ...
Cuiping Li, Jiawei Han, Guoming He, Xin Jin, Yizho...
VMCAI
2005
Springer
14 years 1 months ago
Information Flow Analysis for Java Bytecode
Abstract. We present a context-sensitive compositional analysis of information flow for full (mono-threaded) Java bytecode. Our idea consists in transforming the Java bytecode int...
Samir Genaim, Fausto Spoto
CGF
2010
121views more  CGF 2010»
13 years 8 months ago
GraphDice: A System for Exploring Multivariate Social Networks
Social networks collected by historians or sociologists typically have a large number of actors and edge attributes. Applying social network analysis (SNA) algorithms to these net...
Anastasia Bezerianos, Fanny Chevalier, Pierre Drag...