1149 search results - page 58 / 230 » Minimally non-Pfaffian graphs |
109
click to vote
ANTSW
2010
Springer
14 years 6 months ago
2010
Springer
Abstract. We consider the problem of finding and maintaining communication paths in wireless mobile ad hoc networks (MANET). We consider this problem as a bi-objective problem when...
122
click to vote
ESA
2011
Springer
13 years 11 months ago
2011
Springer
Abstract. In this paper we address the problem of building a compressed self-index that, given a distribution for the pattern queries and a bound on the space occupancy, minimizes ...
IPPS
2009
IEEE
15 years 6 months ago
2009
IEEE
Abstract—In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks...
100
click to vote
EDBT
2006
ACM
15 years 12 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...