Sciweavers

803 search results - page 39 / 161
» Independence in Direct-Product Graphs
Sort
View
ISAAC
2004
Springer
153views Algorithms» more  ISAAC 2004»
15 years 11 months ago
Canonical Data Structure for Interval Probe Graphs
The class of interval probe graphs is introduced to deal with the physical mapping and sequencing of DNA as a generalization of interval graphs. The polynomial time recognition al...
Ryuhei Uehara
COLT
2008
Springer
15 years 7 months ago
Time Varying Undirected Graphs
Undirected graphs are often used to describe high dimensional distributions. Under sparsity conditions, the graph can be estimated using 1 penalization methods. However, current m...
Shuheng Zhou, John D. Lafferty, Larry A. Wasserman
COMBINATORICS
2006
131views more  COMBINATORICS 2006»
15 years 5 months ago
Encores on Cores
We give a new derivation of the threshold of appearance of the k-core of a random graph. Our method uses a hybrid model obtained from a simple model of random graphs based on rand...
Julie Cain, Nicholas C. Wormald
RSA
2002
87views more  RSA 2002»
15 years 5 months ago
Inexpensive d-dimensional matchings
: Suppose that independent U 0 1 weights are assigned to the d 2 n2 edges of the complete d-partite graph with n vertices in each of the d = maximal independent sets. Then the expe...
Bae-Shi Huang, Ljubomir Perkovic, Eric Schmutz
SAC
2011
ACM
14 years 8 months ago
A semantically rich approach for collaborative model edition
We propose a novel approach and tool for collaborative software engineering and development. In model-based software engineering, the underlying data structure is a complex, direc...
Jonathan Michaux, Xavier Blanc, Marc Shapiro, Pier...