270 search results - page 13 / 54 » Properties of Almost All Graphs and Generalized Quantifiers |
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— Network tomography infers internal network characteristics by sending and collecting probe packets from the network edge. Traditional tomographic techniques for general...
SIAMDM
2008
13 years 7 months ago
2008
The Windy Postman Problem consists of finding a minimum cost traversal of all the edges of an undirected graph with two costs associated with each edge, representing the costs of ...
IH
1999
Springer
13 years 11 months ago
1999
Springer
Abstract. One way to protect a digital product is to embed an author's signature into the object in the form of minute errors. However, this technique cannot be directly appli...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
STOC
2010
ACM
14 years 7 days ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...