785 search results - page 70 / 157 » Embedding a Forest in a Graph |
FCCM
2006
IEEE
14 years 4 months ago
2006
IEEE
— Many important applications are organized around long-lived, irregular sparse graphs (e.g., data and knowledge bases, CAD optimization, numerical problems, simulations). The gr...
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...
CORR
2011
Springer
13 years 5 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
ICRA
2005
IEEE
14 years 3 months ago
2005
IEEE
— The aim of this paper is to provide a unified language for modeling both control software and physical plants in real time control systems. This is done by embedding the bond ...
NIPS
2001
13 years 11 months ago
2001
Drawing on the correspondence between the graph Laplacian, the Laplace-Beltrami operator on a manifold, and the connections to the heat equation, we propose a geometrically motiva...