2283 search results - page 69 / 457 » Bounds of Graph Characteristics |
145
click to vote
CONTEXT
2003
Springer
15 years 11 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 ...
172
click to vote
APVIS
2007
15 years 7 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...
143
click to vote
CCCG
2004
15 years 7 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...
144
Voted
ICRA
2007
IEEE
16 years 12 days 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...
186
click to vote
CIE
2007
Springer
16 years 8 days 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....