Sciweavers

Share
APPML
2010
89views more  APPML 2010»
8 years 8 months ago
An independent dominating set in the complement of a minimum dominating set of a tree
We prove that for every tree T of order at least 2 and every minimum dominating set D of T which contains at most one endvertex of T, there is an independent dominating set I of T...
Michael A. Henning, Christian Löwenstein, Die...
ALGORITHMICA
2007
80views more  ALGORITHMICA 2007»
8 years 8 months ago
Tree Spanners for Bipartite Graphs and Probe Interval Graphs
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
Andreas Brandstädt, Feodor F. Dragan, Ho&agra...
ALGORITHMICA
2008
63views more  ALGORITHMICA 2008»
8 years 8 months ago
The Swap Edges of a Multiple-Sources Routing Tree
Let T be a spanning tree of a graph G and S V (G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap ...
Bang Ye Wu, Chih-Yuan Hsiao, Kun-Mao Chao
AHSWN
2008
92views more  AHSWN 2008»
8 years 8 months ago
The (k, l) Coredian Tree for Ad Hoc Networks
In this paper, we present a new efficient strategy for constructing a wireless tree network containing n nodes of diameter while satisfying the QoS requirements such as bandwidth...
Amit Dvir, Michael Segal
APPROX
2010
Springer
150views Algorithms» more  APPROX 2010»
8 years 8 months ago
Reconstruction Threshold for the Hardcore Model
In this paper we consider the reconstruction problem on the tree for the hardcore model. We determine new bounds for the non-reconstruction regime on the k-regular tree showing non...
Nayantara Bhatnagar, Allan Sly, Prasad Tetali
AAAI
1990
8 years 9 months ago
Tree Decomposition with Applications to Constraint Processing
This paper concerns the task of removing redundant information from a given knowledge base, and restructuring it in the form of a tree, so as to admit efficient problem solving ro...
Itay Meiri, Judea Pearl, Rina Dechter
SODA
1993
ACM
118views Algorithms» more  SODA 1993»
8 years 9 months ago
Scapegoat Trees
We present an algorithm for maintaining binary search trees. The amortized complexity per INSERT or DELETE is O(log n) while the worst-case cost of a SEARCH is O(log n). Scapegoat...
Igal Galperin, Ronald L. Rivest
AAAI
1996
8 years 9 months ago
Improved Limited Discrepancy Search
We present an improvement to Harvey and Ginsberg's limited discrepancy search algorithm, which eliminates much of the redundancy in the original, by generating each path from...
Richard E. Korf
SODA
2003
ACM
119views Algorithms» more  SODA 2003»
8 years 9 months ago
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
We consider the problem of finding efficient trees to send information from k sources to a single sink in a network where information can be aggregated at intermediate nodes in t...
Ashish Goel, Deborah Estrin
WSCG
2004
170views more  WSCG 2004»
8 years 9 months ago
An Image-Based Multiresolution Model for Interactive Foliage Rendering
This paper presents a new method for realistic real-time rendering of tree foliage. Some approaches to this problem have been presented before but the quality of their results was...
Javier Lluch, Emilio Camahort, Roberto Vivó
books