2503 search results - page 74 / 501 » A study of 3-arc graphs |
151
click to vote
ICCV
2007
IEEE
16 years 8 months ago
2007
IEEE
Capacity scaling is a hierarchical approach to graph representation that can improve theoretical complexity and practical efficiency of max-flow/min-cut algorithms. Introduced by ...
149
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Consider a 0–1 observation matrix M, where rows correspond to entities and columns correspond to signals; a value of 1 (or 0) in cell (i, j) of M indicates that signal j has bee...
139
click to vote
JGT
2006
15 years 6 months ago
2006
This paper studies the circular chromatic number of a class of circular partitionable graphs. We prove that an infinite family of circular partitionable graphs have
132
click to vote
RSA
2006
15 years 5 months ago
2006
We study the question as to when a random graph with n vertices and m edges contains a copy of almost all graphs with n vertices and cn/2 edges, c
169
click to vote
RECOMB
2007
Springer
16 years 6 months ago
2007
Springer
Currently, large-scale projects are underway to perform whole genome disease association studies. Such studies involve the genotyping of hundreds of thousands of SNP markers. One o...