148 search results - page 21 / 30 » An Algebraic Theory of Graph Reduction |
ICC
2007
IEEE
13 years 11 months ago
2007
IEEE
This paper reports on a promising approach for solving problems found when Multi Protocol Label Switching (MPLS), soon to be a dominant protocol, is used in core network systems. D...
SPAA
2004
ACM
14 years 24 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
COMPGEOM
2010
ACM
14 years 14 days ago
2010
ACM
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
VALUETOOLS
2006
ACM
14 years 1 months ago
2006
ACM
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
ESWS
2008
Springer
13 years 9 months ago
2008
Springer
The goal of this paper is to give an overview of the basics of the theory of RDF databases. We provide a formal definition of RDF that includes the features that distinguish this m...