1370 search results - page 147 / 274 » On grids in topological graphs |
175
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...
157
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
Studies of the fault-tolerance of graphs have tended to largely concentrate on classical graph connectivity. This measure is very basic, and conveys very little information for des...
142
click to vote
PAA
2006
15 years 6 months ago
2006
This paper proposes to use three-dimensional information derived from the graph of an image function for texture description. The graph of an image function is a rumpled surface ap...
180
click to vote
TCS
2008
15 years 6 months ago
2008
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...
139
click to vote
WIOPT
2010
IEEE
15 years 4 months ago
2010
IEEE
—K-shell (or k-core) graph decomposition methods were introduced as a tool for studying the structure of large graphs. K-shell decomposition methods have been recently proposed [...