Sciweavers

DAM
2006
97views more  DAM 2006»
14 years 11 months ago
Fully dynamic recognition algorithm and certificate for directed cographs
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
DAM
2006
124views more  DAM 2006»
14 years 11 months ago
Coloring copoints of a planar point set
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
DAM
2006
87views more  DAM 2006»
14 years 11 months ago
A new trust region technique for the maximum weight clique problem
A new simple generalization of the Motzkin
Stanislav Busygin
57
Voted
DAM
2006
88views more  DAM 2006»
14 years 11 months ago
NP-completeness results for edge modification problems
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á...
DAM
2006
56views more  DAM 2006»
14 years 11 months ago
On the least size of a graph with a given degree set
Amitabha Tripathi, Sujith Vijay
DAM
2006
56views more  DAM 2006»
14 years 11 months ago
Reoptimization gaps versus model errors in online-dispatching of service units for ADAC
Benjamin Hiller, Sven Oliver Krumke, Jörg Ram...
DAM
2006
88views more  DAM 2006»
14 years 11 months ago
Domination analysis for minimum multiprocessor scheduling
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
DAM
2006
78views more  DAM 2006»
14 years 11 months ago
A competitive and cooperative approach to propositional satisfiability
Katsumi Inoue, Takehide Soh, Seiji Ueda, Yoshito S...
DAM
2006
63views more  DAM 2006»
14 years 11 months ago
Efficient automatic simulation of parallel computation on networks of workstations
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...