3471 search results - page 411 / 695 » Obstacle Numbers of Graphs |
209
click to vote
DCG
2011
15 years 1 months ago
2011
We study the expected topological properties of ˇCech and Vietoris-Rips complexes built on random points in Rd . We find higher dimensional analogues of known results for connect...
200
Voted
BMCBI
2011
15 years 1 months ago
2011
Background: The number of gene sequences that are available for comparative genomics approaches is increasing extremely quickly. A current challenge is to be able to handle this h...
191
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. Connected dominating set (CDS) has a wide range of applications in wireless ad hoc networks. A number of approximation algorithms for constructing a small CDS in wireless...
162
click to vote
FUZZIEEE
2007
IEEE
16 years 1 months ago
2007
IEEE
— This paper discusses ways of navigating online contact networks - networks of social connections defined under a relational context - on a way that can provide much more meani...
176
click to vote
PKDD
2005
Springer
16 years 5 days ago
2005
Springer
For an undirected graph ¢ without self-loop, we prove: (i) that the number of closed patterns in the adjacency matrix of ¢ is even; (ii) that the number of the closed patterns i...