Sciweavers

515 search results - page 52 / 103
» Layouts of Expander Graphs
Sort
View
RSA
2011
126views more  RSA 2011»
13 years 5 months ago
Local resilience of almost spanning trees in random graphs
We prove that for fixed integer D and positive reals α and γ, there exists a constant C0 such that for all p satisfying p(n) ≥ C0/n, the random graph G(n, p) asymptotically a...
József Balogh, Béla Csaba, Wojciech ...
SAS
2009
Springer
212views Formal Methods» more  SAS 2009»
14 years 11 months ago
The Causal Graph Revisited for Directed Model Checking
Directed model checking is a well-established technique to tackle the state explosion problem when the aim is to find error states in large systems. In this approach, the state spa...
Martin Wehrle, Malte Helmert
IDMS
1998
Springer
122views Multimedia» more  IDMS 1998»
14 years 3 months ago
Object Graphs as Pivotal Representations for Hypermedia
This position paper advocates a possible bridging of multiple heterogeneous formats and interfaces for hypermedia data and metadata. Rather than one more text, bit-stream or proced...
Marc Brelot, Gilles Privat
AGTIVE
2007
Springer
14 years 5 months ago
Generating Eclipse Editor Plug-Ins Using Tiger
We present Tiger, a visual environment to design visual language (VL) specifications based on meta models, graph grammars and layout definitions. A VL specification serves as ba...
Enrico Biermann, Karsten Ehrig, Claudia Ermel, Gab...
STACS
2007
Springer
14 years 4 months ago
Hard Metrics from Cayley Graphs of Abelian Groups
: Hard metrics are the class of extremal metrics with respect to embedding into Euclidean spaces: they incur Ω(logn) multiplicative distortion, which is as large as it can possib...
Ilan Newman, Yuri Rabinovich