2079 search results - page 223 / 416 » Universality of random graphs |
194
click to vote
CONCUR
2008
Springer
15 years 8 months ago
2008
Springer
We present an algorithm for partial order reduction in the context of a countable universe of deterministic actions, of which finitely many are enabled at any given state. This mea...
198
click to vote
BMCBI
2007
15 years 6 months ago
2007
Background: Analyzing differential-gene-expression data in the context of protein-interaction networks (PINs) yields information on the functional cellular status. PINs can be for...
190
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
159
click to vote
GD
2005
Springer
16 years 2 days ago
2005
Springer
Consider a drawing of a graph G in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of G, is the classical graph...
174
click to vote
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
Bidirectional transformations provide a novel mechanism for synchronizing and maintaining the consistency of information between input and output. Despite many promising results o...