1257 search results - page 181 / 252 » A generalization of Euler's constant |
IJRR
2010
13 years 6 months ago
2010
Robots consisting of several concentric, preshaped, elastic tubes can work dexterously in narrow, constrained, and/or winding spaces, as are commonly found in minimally invasive s...
JCT
2010
13 years 6 months ago
2010
A graph G on n vertices is Hamiltonian if it contains a cycle of length n and pancyclic if it contains cycles of length for all 3 ≤ ≤ n. Write α(G) for the independence numbe...
SIAMCOMP
2010
13 years 6 months ago
2010
Abstract. We study the Edge Disjoint Paths (EDP) problem in undirected graphs: Given a graph G with n nodes and a set T of pairs of terminals, connect as many terminal pairs as pos...
SWAT
2010
Springer
13 years 6 months ago
2010
Springer
We study the problem of minimizing the diameter of a graph by adding k shortcut edges, for speeding up communication in an existing network design. We develop constant-factor appro...
SYNTHESE
2010
13 years 6 months ago
2010
Throughout more than two millennia philosophers adhered massively to ideal standards of scientific rationality going back ultimately to Aristotle’s Analytica posteriora. These s...