2283 search results - page 69 / 457 » Bounds of Graph Characteristics |
134
Voted
CONTEXT
2003
Springer
15 years 10 months ago
2003
Springer
This paper discusses the dynamic of context through the use of a context-based formalism called contextual graphs that has been initially developed in the SART application for the ...
164
Voted
APVIS
2007
15 years 6 months ago
2007
A straight-line grid drawing of a planar graph G is a drawing of G on an integer grid such that each vertex is drawn as a grid point and each edge is drawn as a straight-line segm...
136
Voted
CCCG
2004
15 years 6 months ago
2004
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
133
click to vote
ICRA
2007
IEEE
15 years 11 months ago
2007
IEEE
Abstract— In this paper, we formalize the problem of barrier coverage, that is, the problem of preventing undetected intrusion in a particular region using robot sensors. We solv...
170
Voted
CIE
2007
Springer
15 years 11 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....