341 search results - page 12 / 69 » Paired bondage in trees |
132
click to vote
WG
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper we study the existence of a small set T of spanning trees that collectively “1-span” an interval graph G. In particular, for any pair of vertices u, v w...
164
click to vote
NETGAMES
2003
ACM
15 years 11 months ago
2003
ACM
In this paper, we propose a novel multicast routing algorithm that is based on application-level priorities and network characteristics: The application may specify an individual ...
161
click to vote
RT
2001
Springer
15 years 10 months ago
2001
Springer
The goal of this paper is the interactive rendering of 3D trees covering a landscape, with shading and shadows consistent with the lighting conditions. We propose a new IBR represe...
188
click to vote
ICDT
2012
ACM
13 years 8 months ago
2012
ACM
We consider the problem of repairing unranked trees (e.g., XML documents) satisfying a given restriction specification R (e.g., a DTD) into unranked trees satisfying a given targ...
173
click to vote
GLOBECOM
2007
IEEE
16 years 11 days ago
2007
IEEE
— Virtual Private Networks (VPN) provide a secure and reliable communication between customer sites over a shared network. Two models were proposed for the service provisioning i...