Sciweavers

2503 search results - page 98 / 501
» A study of 3-arc graphs
Sort
View
160
Voted
CAAN
2004
Springer
15 years 11 months ago
Bipartite Graphs as Models of Complex Networks
It appeared recently that the classical random graph model used to represent real-world complex networks does not capture their main properties. Since then, various attempts have ...
Jean-Loup Guillaume, Matthieu Latapy
145
Voted
GG
2004
Springer
15 years 11 months ago
Model Checking Graph Transformations: A Comparison of Two Approaches
Model checking is increasingly popular for hardware and, more recently, software verification. In this paper we describe two different approaches to extend the benefits of model ...
Arend Rensink, Ákos Schmidt, Dániel ...
WG
2004
Springer
15 years 11 months ago
Collective Tree Spanners and Routing in AT-free Related Graphs
In this paper we study collective additive tree spanners for families of graphs that either contain or are contained in AT-free graphs. We say that a graph G = (V, E) admits a sys...
Feodor F. Dragan, Chenyu Yan, Derek G. Corneil
199
Voted
JOT
2010
216views more  JOT 2010»
15 years 4 months ago
A UML and Colored Petri Nets Integrated Modeling and Analysis Approach using Graph Transformation
Nowadays, UML is considered to be the standardized language for object-oriented modeling and analysis. However, UML cannot be used for automatic analyses and simulation. In this pa...
Elhillali Kerkouche, Allaoua Chaoui, El Bay Bouren...
COMBINATORICA
2010
15 years 3 months ago
Online vertex-coloring games in random graphs
Consider the following one-player game. The vertices of a random graph on n vertices are revealed to the player one by one. In each step, also all edges connecting the newly reveal...
Martin Marciniszyn, Reto Spöhel