Sciweavers

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

12

STOC
1991
ACM

favoriteEmaildiscussreport

163views Algorithms» more STOC 1991»

Clique Partitions, Graph Compression, and Speeding-Up Algorithms

13 years 7 months ago

Clique Partitions, Graph Compression, and Speeding-Up Algorithms

Download www.combinatorics.net

Tomás Feder, Rajeev Motwani

Real-time Traffic

Algorithms | STOC 1991 |

claim paper

Related Content

» Speeding up algorithms on compressed web graphs

» Partitioning Graphs to Speed Up Dijkstras Algorithm

» Speeding up Parallel Graph Coloring

» An Approach to Graph and Netlist Compression

» Decremental Clique Problem

» Parameterized Complexity of the Clique Partition Problem

» Partition into cliques for cubic graphs Planar case complexity and approximation

» Matroid Representation of Clique Complexes

» A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs

Post Info
More Details (n/a)

Added	27 Aug 2010
Updated	27 Aug 2010
Type	Conference
Year	1991
Where	STOC
Authors	Tomás Feder, Rajeev Motwani

Comments (0)