505 search results - page 50 / 101 » On A Graph Formalism for Ordered Edges |
205
click to vote
ISAAC
2004
Springer
16 years 3 days ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
150
click to vote
BROADNETS
2007
IEEE
16 years 1 months ago
2007
IEEE
—Attacks launched over the Internet have become a pressing problem. Attackers make use of a variety of techniques to anonymize their traffic, in order to escape detection and pr...
173
click to vote
CCCG
2007
15 years 8 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...
164
click to vote
TCS
2010
15 years 1 months ago
2010
Abstract. A trivalent diagram is a connected, two-colored bipartite graph (parallel edges allowed but not loops) such that every black vertex is of degree 1 or 3 and every white ve...
162
click to vote
EDBT
2009
ACM
16 years 1 months ago
2009
ACM
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...