Sciweavers

341 search results - page 12 / 69
» Paired bondage in trees
Sort
View
WG
2005
Springer
15 years 3 months ago
Collective Tree 1-Spanners for Interval Graphs
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...
Derek G. Corneil, Feodor F. Dragan, Ekkehard K&oum...
NETGAMES
2003
ACM
15 years 2 months ago
Priority-based distribution trees for application-level multicast
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 ...
Jürgen Vogel, Jörg Widmer, Dirk Farin, M...
RT
2001
Springer
15 years 2 months ago
Interactive Rendering of Trees with Shading and Shadows
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...
Alexandre Meyer, Fabrice Neyret, Pierre Poulin
ICDT
2012
ACM
226views Database» more  ICDT 2012»
13 years 1 days ago
Bounded repairability for regular tree languages
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...
Gabriele Puppis, Cristian Riveros, Slawek Staworko
GLOBECOM
2007
IEEE
15 years 4 months ago
Hierarchical Provisioning Algorithm for Virtual Private Networks Using the Hose Model
— 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...
Monia Ghobadi, Sudhakar Ganti, Gholamali C. Shoja