Sciweavers

TALG
2008
97views more  TALG 2008»
14 years 14 days ago
On an infinite family of solvable Hanoi graphs
The Tower of Hanoi problem is generalized by placing pegs on the vertices of a given directed graph G with two distinguished vertices, S and D, and allowing moves only along arcs o...
Dany Azriel, Noam Solomon, Shay Solomon
TALG
2008
67views more  TALG 2008»
14 years 14 days ago
Structure and linear-time recognition of 4-leaf powers
A graph G is the k-leaf power of a tree T if its vertices are leaves of T such that two vertices are adjacent in G if and only if their distance in T is at most k. Then T is a k-le...
Andreas Brandstädt, Van Bang Le, R. Sritharan
TALG
2008
115views more  TALG 2008»
14 years 14 days ago
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in
Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatki...
TALG
2008
131views more  TALG 2008»
14 years 14 days ago
Kinetic and dynamic data structures for closest pair and all nearest neighbors
We present simple, fully dynamic and kinetic data structures, which are variants of a dynamic two-dimensional range tree, for maintaining the closest pair and all nearest neighbors...
Pankaj K. Agarwal, Haim Kaplan, Micha Sharir
TALG
2008
67views more  TALG 2008»
14 years 14 days ago
Multipartite priority queues
Amr Elmasry, Claus Jensen, Jyrki Katajainen
TALG
2008
81views more  TALG 2008»
14 years 14 days ago
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics
We introduce a new notion of embedding, called minimum-relaxation ordinal embedding, parallel to the standard notion of minimum-distortion (metric) embedding. In an ordinal embedd...
Noga Alon, Mihai Badoiu, Erik D. Demaine, Martin F...
TALG
2008
127views more  TALG 2008»
14 years 14 days ago
Fully dynamic algorithms for chordal graphs and split graphs
We present the rst dynamic algorithm that maintains a clique tree representation of a chordal graph and supports the following operations: (1) query whether deleting or inserting ...
Louis Ibarra
TALG
2008
111views more  TALG 2008»
14 years 14 days ago
On the approximability of some network design problems
Julia Chuzhoy, Anupam Gupta, Joseph Naor, Amitabh ...