19 search results - page 4 / 4 » On the Structure of 3-connected Matroids and Graphs |
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
Geographic Routing is a family of routing algorithms that uses geographic point locations as addresses for the purposes of routing. Such routing algorithms have proven to be both ...
ISAAC
2005
Springer
13 years 10 months ago
2005
Springer
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the ...
NIPS
2008
13 years 6 months ago
2008
Metal binding is important for the structural and functional characterization of proteins. Previous prediction efforts have only focused on bonding state, i.e. deciding which prot...
SIAMDM
2000
13 years 5 months ago
2000
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...