Sciweavers

22 search results - page 2 / 5
» Monotony properties of connected visible graph searching
Sort
View
COMPGEOM
1994
ACM
13 years 9 months ago
Competitive Searching in a Generalized Street
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
Amitava Datta, Christian Icking
FCT
2003
Springer
13 years 11 months ago
Graph Searching, Elimination Trees, and a Generalization of Bandwidth
The bandwidth minimization problem has a long history and a number of practical applications. In this paper we introduce a natural extension of bandwidth to partially ordered layo...
Fedor V. Fomin, Pinar Heggernes, Jan Arne Telle
HT
2009
ACM
14 years 8 days ago
Hyperincident connected components of tagging networks
Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of c...
Nicolas Neubauer, Klaus Obermayer
INFOCOM
2006
IEEE
13 years 11 months ago
Collaboration Improves the Connectivity of Wireless Networks
— In the standard approach to studying connectivity, a physical layer is assumed that allows direct transmission between neighbors within some fixed distance. The graph resultin...
Sanquan Song, Dennis Goeckel, Donald F. Towsley
SMA
2008
ACM
173views Solid Modeling» more  SMA 2008»
13 years 5 months ago
Visibility-based feature extraction from discrete models
In this paper, we present a new visibility-based feature extraction algorithm from discrete models as dense point clouds resulting from laser scans. Based on the observation that ...
Antoni Chica