4171 search results - page 569 / 835 » Choice numbers of graphs |
206
Voted
NIPS
2004
15 years 8 months ago
2004
We show how to build hierarchical, reduced-rank representation for large stochastic matrices and use this representation to design an efficient algorithm for computing the largest...
162
Voted
PSB
2004
15 years 8 months ago
2004
Association studies in populations relate genomic variation among individuals with medical condition. Key to these studies is the development of efficient and affordable genotypin...
229
click to vote
COMGEO
2006
ACM
15 years 6 months ago
2006
ACM
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
177
click to vote
DM
2007
15 years 6 months ago
2007
In this paper, we address the problem of λ labelings, that was introduced in the context of frequency assignment for telecommunication networks. In this model, stations within a ...
185
click to vote
SMI
2010
IEEE
15 years 5 months ago
2010
IEEE
—It has recently been shown that if we twist an arbitrary subset of edges of a mesh on an orientable surface, the resulting extended graph rotation system (EGRS) can be used to i...