Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

SODA
2001
ACM

favoriteEmaildiscussreport

97views Algorithms» more SODA 2001»

An efficient algorithm for the configuration problem of dominance graphs

13 years 6 months ago

An efficient algorithm for the configuration problem of dominance graphs

Download www.univ-orleans.fr

Ernst Althaus, Denys Duchier, Alexander Koller, Ku

Real-time Traffic

Algorithms | SODA 2001 |

claim paper

Related Content

» Efficient Algorithms for the Domination Problems on Interval and CircularArc Graphs

» Dominant Graph An Efficient Indexing Structure to Answer TopK Queries

» Brief announcement efficient graph algorithms without synchronization

» Distributed Approximation Algorithms for Weighted Problems in MinorClosed Families

» Algorithmic Lower Bounds for Problems Parameterized by Cliquewidth

» An OnTime Algorithm for the PairedDomination Problem on Permutation Graphs

» Linear Problem Kernels for NPHard Problems on Planar Graphs

» A BranchandReduce Algorithm for Finding a Minimum Independent Dominating Set

» An Efficient Algorithm for Finding DoubleVertex Dominators in Circuit Graphs

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2001
Where	SODA
Authors	Ernst Althaus, Denys Duchier, Alexander Koller, Kurt Mehlhorn, Joachim Niehren, Sven Thiel

Comments (0)