TALG 2008 | Sciweavers

14

TALG
2008

97views more TALG 2008»

On an infinite family of solvable Hanoi graphs

13 years 4 months ago

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

claim paper

Read More »

16

click to vote

TALG
2008

67views more TALG 2008»

Structure and linear-time recognition of 4-leaf powers

13 years 4 months ago

Download www.informatik.uni-rostock.de

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

claim paper

Read More »

14

click to vote

TALG
2008

115views more TALG 2008»

Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications

13 years 4 months ago

Download www.disp.uniroma2.it

We provide an algorithm listing all minimal dominating sets of a graph on n vertices in

Fedor V. Fomin, Fabrizio Grandoni, Artem V. Pyatki...

claim paper

Read More »

27

click to vote

TALG
2008

131views more TALG 2008»

Kinetic and dynamic data structures for closest pair and all nearest neighbors

13 years 4 months ago

Download www.math.tau.ac.il

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

claim paper

Read More »

17

click to vote

TALG
2008

67views more TALG 2008»

Multipartite priority queues

13 years 4 months ago

Download www.cphstl.dk

Amr Elmasry, Claus Jensen, Jyrki Katajainen

claim paper

Read More »

14

click to vote

TALG
2008

81views more TALG 2008»

Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics

13 years 4 months ago

Download www.tau.ac.il

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...

claim paper

Read More »

13

click to vote

TALG
2008

127views more TALG 2008»

Fully dynamic algorithms for chordal graphs and split graphs

13 years 4 months ago

Download facweb.cs.depaul.edu

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

claim paper

Read More »

9

click to vote

TALG
2008

122views more TALG 2008»

An asymptotic approximation scheme for multigraph edge coloring

13 years 4 months ago