Sciweavers

1756 search results - page 6 / 352
» Directed scale-free graphs
Sort
View
GCB
2005
Springer
74views Biometrics» more  GCB 2005»
14 years 1 months ago
Exploiting scale-free information from expression data for cancer classification
: In most studies concerning expression data analyses information on the variability of gene intensity across samples is usually exploited. This information is sensitive to initial...
Alexey V. Antonov, Igor V. Tetko, Denis Kosykh, Di...
CONSTRAINTS
2010
110views more  CONSTRAINTS 2010»
13 years 5 months ago
Solving subgraph isomorphism problems with constraint programming
The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated ...
Stéphane Zampelli, Yves Deville, Christine ...
IACR
2011
104views more  IACR 2011»
12 years 7 months ago
Short Transitive Signatures for Directed Trees
A transitive signature scheme allows to sign a graph in such a way that, given the signatures of edges (a, b) and (b, c), it is possible to compute the signature for the edge (or ...
Philippe Camacho, Alejandro Hevia
WG
2010
Springer
13 years 5 months ago
From Path Graphs to Directed Path Graphs
We present a linear time algorithm to greedily orient the edges of a path graph model to obtain a directed path graph model (when possible). Moreover we extend this algorithm to fi...
Steven Chaplick, Marisa Gutierrez, Benjamin L&eacu...
IPPS
1998
IEEE
14 years 18 hour ago
Emulating Direct Products by Index-Shuffle Graphs
In the theoretical framework of graph embedding and network emulations, we show that the index-shuffle graph (a bounded-degreehypercube-like interconnection network, recently intr...
Bojana Obrenic