4865 search results - page 73 / 973 » The Complexity of Graph Connectivity |
NIPS
2003
13 years 11 months ago
2003
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
APPML
2007
13 years 10 months ago
2007
It is shown that every planar graph with no separating triangles is a subgraph of a Hamiltonian planar graph; that is, Whitney’s theorem holds without the assumption of a triang...
INFOCOM
2007
IEEE
14 years 4 months ago
2007
IEEE
— Recently, research on disconnected networks has been fostered by several studies on delay-tolerant networks, which are designed in order to sustain disconnected operations. We ...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
CDC
2008
IEEE
14 years 4 months ago
2008
IEEE
— In this paper we examine the leader-to-follower ratio needed to maintain connectivity in a leader-follower multiagent network with proximity based communication topology. In th...