159 search results - page 24 / 32 » Undirected Graphs of Entanglement 2 |
ISAAC
1995
Springer
15 years 1 months ago
1995
Springer
Given an undirected graph G, the maximal planar subgraph problem is to determine a planar subgraph H of G such that no edge of G-H can be added to H without destroying planarity. P...
CIKM
2008
Springer
14 years 10 months ago
2008
Springer
Privacy preservation has recently received considerable attention for location-based mobile services. In this paper, we present location-dependent attack resulting from continuous...
DISOPT
2008
14 years 9 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
SIROCCO
2010
14 years 11 months ago
2010
Abstract. This paper concerns graph spanners that approximate multipaths between pair of vertices of an undirected graphs with n vertices. Classically, a spanner H of stretch s for...
103
click to vote
SPAA
2006
ACM
15 years 3 months ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...