3268 search results - page 20 / 654 » The hub number of a graph |
SIAMCOMP
2008
14 years 11 months ago
2008
The Graph Theorem of classical recursion theory states that a total function on the natural numbers is computable, if and only if its graph is recursive. It is known that this res...
132
click to vote
AQUILEIA
2011
13 years 11 months ago
2011
A large number of technologies, such as Geographic Information Systems (GIS), Global Positioning Systems (GPS), Remote Sensing (RS), geophysical instruments, allows nowadays for fa...
COMBINATORICS
2007
14 years 11 months ago
2007
We investigate the notion of quantum chromatic number of a graph, which is the minimal number of colours necessary in a protocol in which two separated provers can convince a refe...
116
click to vote
WG
2010
Springer
14 years 10 months ago
2010
Springer
Motivated by questions in computer vision and sensor networks, Alpert et al. [3] introduced the following definitions. Given a graph G, an obstacle representation of G is a set of...
110
click to vote
SIAMDM
2010
14 years 10 months ago
2010
A set of vertices C in a graph is convex if it contains all vertices which lie on shortest paths between vertices in C. The convex hull of a set of vertices S is the smallest conve...