Sciweavers

400 search results - page 31 / 80
» On some Properties of DNA Graphs
Sort
View
FOCS
2008
IEEE
14 years 2 months ago
k-Wise Independent Random Graphs
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...
Noga Alon, Asaf Nussboim
COMBINATORICS
2007
105views more  COMBINATORICS 2007»
13 years 8 months ago
A Two Parameter Chromatic Symmetric Function
We introduce and develop a two-parameter chromatic symmetric function for a simple graph G over the field of rational functions in q and t , Q (q, t). We derive its expansion in ...
Ellison-Anne Williams
TCS
2010
13 years 6 months ago
Adaptive star grammars and their languages
Motivated by applications that require mechanisms for describing the structure of object-oriented programs, adaptive star grammars are introduced, and their fundamental properties...
Frank Drewes, Berthold Hoffmann, Dirk Janssens, Ma...
SIMUTOOLS
2008
13 years 9 months ago
Snoopy: a tool to design and animate/simulate graph-based formalisms
We sketch the fundamental properties and features of Snoopy, a tool to model and execute (animate, simulate) hierarchical graph-based system descriptions. The tool comes along wit...
Monika Heiner, Ronny Richter, Martin Schwarick
JAL
2006
114views more  JAL 2006»
13 years 7 months ago
A wide-range algorithm for minimal triangulation from an arbitrary ordering
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm0) time implementation and a more involved O(nm) time imple...
Anne Berry, Jean Paul Bordat, Pinar Heggernes, Gen...