Sciweavers

3268 search results - page 20 / 654
» The hub number of a graph
Sort
View
SIAMCOMP
2008
72views more  SIAMCOMP 2008»
13 years 9 months ago
Plottable Real Number Functions and the Computable Graph Theorem
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...
Vasco Brattka
AQUILEIA
2011
117views more  AQUILEIA 2011»
12 years 9 months ago
Integrated Archaeological Investigations for the Study of the Greater Aquileia Area
A large number of technologies, such as Geographic Information Systems (GIS), Global Positioning Systems (GPS), Remote Sensing (RS), geophysical instruments, allows nowadays for fa...
Arianna Traviglia
COMBINATORICS
2007
118views more  COMBINATORICS 2007»
13 years 9 months ago
On the Quantum Chromatic Number of a Graph
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...
Peter J. Cameron, Ashley Montanaro, Michael W. New...
WG
2010
Springer
13 years 8 months ago
Graphs with Large Obstacle Numbers
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...
Padmini Mukkamala, János Pach, Deniz Sari&o...
SIAMDM
2010
130views more  SIAMDM 2010»
13 years 8 months ago
On the Hull Number of Triangle-Free Graphs
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...
Mitre Costa Dourado, Fábio Protti, Dieter R...