Sciweavers

3268 search results - page 71 / 654
» The hub number of a graph
Sort
View
APPML
2008
159views more  APPML 2008»
15 years 6 months ago
The rook problem on saw-toothed chessboards
A saw-toothed chessboard, or STC for short, is a kind of chessboard whose boundary forms two staircases from left down to right without any hole inside it. A rook at square (i, j)...
Hon-Chan Chen, Ting-Yem Ho
DM
2000
89views more  DM 2000»
15 years 6 months ago
On median graphs and median grid graphs
Let G be a Q4-free median graph on n vertices and m edges. Let k be the number of equivalence classes of Djokovi
Sandi Klavzar, Riste Skrekovski
BMCBI
2010
214views more  BMCBI 2010»
15 years 6 months ago
AutoSOME: a clustering method for identifying gene expression modules without prior knowledge of cluster number
Background: Clustering the information content of large high-dimensional gene expression datasets has widespread application in "omics" biology. Unfortunately, the under...
Aaron M. Newman, James B. Cooper
CRYPTO
2001
Springer
152views Cryptology» more  CRYPTO 2001»
15 years 10 months ago
Secure Distributed Linear Algebra in a Constant Number of Rounds
Consider a network of processors among which elements in a finite field K can be verifiably shared in a constant number of rounds. Assume furthermore constant-round protocols ar...
Ronald Cramer, Ivan Damgård
COMBINATORICS
2006
123views more  COMBINATORICS 2006»
15 years 6 months ago
The Non-Crossing Graph
Two sets are non-crossing if they are disjoint or one contains the other. The noncrossing graph NCn is the graph whose vertex set is the set of nonempty subsets of [n] = {1, . . ....
Nathan Linial, Michael E. Saks, David Statter