DAM 2006 | Sciweavers

41

DAM
2006

97views more DAM 2006»

Fully dynamic recognition algorithm and certificate for directed cographs

14 years 2 months ago

This paper presents an optimal fully dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc ...

Christophe Crespelle, Christophe Paul

claim paper

Read More »

36

click to vote

DAM
2006

124views more DAM 2006»

Coloring copoints of a planar point set

14 years 2 months ago

Download math.gmu.edu

To a set of n points in the plane, one can associate a graph that has less than n2 vertices and has the property that k-cliques in the graph correspond vertex sets of convex k-gon...

Walter Morris

claim paper

Read More »

35

click to vote

DAM
2006

87views more DAM 2006»

A new trust region technique for the maximum weight clique problem

14 years 2 months ago

Download www.stasbusygin.org

A new simple generalization of the Motzkin

Stanislav Busygin

claim paper

Read More »

29

click to vote

DAM
2006

88views more DAM 2006»

NP-completeness results for edge modification problems

14 years 2 months ago

Download mate.dm.uba.ar

The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs...

Pablo Burzyn, Flavia Bonomo, Guillermo Durá...

claim paper

Read More »

27

click to vote

DAM
2006

56views more DAM 2006»

On the least size of a graph with a given degree set

14 years 2 months ago

Download www.math.rutgers.edu

Amitabha Tripathi, Sujith Vijay

claim paper

Read More »

25

click to vote

DAM
2006

56views more DAM 2006»

Reoptimization gaps versus model errors in online-dispatching of service units for ADAC

14 years 2 months ago

Download www.zib.de

Benjamin Hiller, Sven Oliver Krumke, Jörg Ram...

claim paper

Read More »

29

click to vote

DAM
2006

88views more DAM 2006»

Domination analysis for minimum multiprocessor scheduling

14 years 2 months ago

Download www.cs.rhul.ac.uk

Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is the maximal real q such that the solution x(I) obt...

Gregory Gutin, Tommy R. Jensen, Anders Yeo

claim paper

Read More »

29

click to vote

DAM
2006

78views more DAM 2006»

A competitive and cooperative approach to propositional satisfiability

14 years 2 months ago

Download kaminari.scitec.kobe-u.ac.jp

Katsumi Inoue, Takehide Soh, Seiji Ueda, Yoshito S...

claim paper

Read More »

32

click to vote

DAM
2006

63views more DAM 2006»

Efficient automatic simulation of parallel computation on networks of workstations

14 years 2 months ago

Download www.dia.unisa.it

Andrews et al. [Automatic method for hiding latency in high bandwidth networks, in: Proceedings of the ACM Symposium on Theory of Computing, 1996, pp. 257

Christos Kaklamanis, Danny Krizanc, Manuela Montan...

claim paper

Read More »

32

click to vote

DAM
2006

58views more DAM 2006»

The elimination procedure for the competition number is not optimal

14 years 2 months ago

Download www.math.unl.edu

Stephen G. Hartke

claim paper

Read More »

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers