3267 search results - page 182 / 654 » Generalized quasirandom graphs |
139
click to vote
GLOBECOM
2006
IEEE
16 years 19 days ago
2006
IEEE
— We consider the problem of distributing a content of finite size to a group of users connected through an overlay network that is built by a peer-to-peer application. The goal...
190
click to vote
MFCS
2005
Springer
16 years 2 days ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
152
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
Pointed pseudo-triangulations are planar minimally rigid graphs embedded in the plane with pointed vertices (adjacent to an angle larger than π). In this paper we prove that the ...
159
click to vote
CIAC
2010
Springer
15 years 10 months ago
2010
Springer
In this paper, we consider an arbitrary class H of rooted graphs such that each biconnected component is given by a representation with reflectional symmetry, which allows a roote...
151
click to vote
VISSYM
2007
15 years 9 months ago
2007
Grouse is a feature-based approach to steerable exploration of a graph and an associated hierarchy. Steerability allows exploration to begin immediately, rather than requiring a c...