Sciweavers

398 search results - page 7 / 80
» Critical exponents of graphs
Sort
View
ENTCS
2008
153views more  ENTCS 2008»
13 years 9 months ago
Efficient Conflict Detection in Graph Transformation Systems by Essential Critical Pairs
The well-known notion of critical pairs already allows a static conflict detection, which is important for all kinds of applications and already implemented in AGG. Unfortunately ...
Leen Lambers, Hartmut Ehrig, Fernando Orejas
AIMS
2007
Springer
14 years 3 months ago
Graph Models of Critical Infrastructure Interdependencies
Critical infrastructures are interconnected on multiple levels, and due to their size models with acceptable computational complexity and adequate modeling capacities must be devel...
Nils Kalstad Svendsen, Stephen D. Wolthusen
CPC
2007
76views more  CPC 2007»
13 years 9 months ago
A Point Process Describing the Component Sizes in the Critical Window of the Random Graph Evolution
We study a point process describing the asymptotic behavior of sizes of the largest components of the random graph G(n, p) in the critical window, that is, for p = n−1 + λn−4/...
Svante Janson, Joel Spencer
DAC
2006
ACM
14 years 10 months ago
Efficient simulation of critical synchronous dataflow graphs
Simulation and verification using electronic design automation (EDA) tools are key steps in the design process for communication and signal processing systems. The synchronous dat...
Chia-Jui Hsu, José Luis Pino, Ming-Yung Ko,...
ORL
2007
102views more  ORL 2007»
13 years 9 months ago
Using critical sets to solve the maximum independent set problem
A method that utilizes the polynomially solvable critical independent set problem for solving the maximum independent set problem on graphs with a nonempty critical independent se...
Sergiy Butenko, Svyatoslav Trukhanov