Sciweavers

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

25

JEA
2008

favoriteEmaildiscussreport

57views more JEA 2008»

Data reduction and exact algorithms for clique cover

13 years 11 months ago

Data reduction and exact algorithms for clique cover

Download theinf1.informatik.uni-jena.de

Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Nie

Real-time Traffic

JEA 2008 |

claim paper

Related Content

» A New Approach and Faster Exact Methods for the Maximum Common Subgraph Problem

» Efficient inference with cardinalitybased clique potentials

» Explicit Sensor Network Localization using Semidefinite Representations and Facial Reducti...

» Scalable NodeLevel Computation Kernels for Parallel Exact Inference

» Solving Geometric Covering Problems by Data Reduction

» An Empirical Comparison of Exact Nearest Neighbour Algorithms

» Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact...

» Collective Inference for Extraction MRFs Coupled with Symmetric Clique Potentials

» Spaceeconomical partial gram indices for exact substring matching

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2008
Where	JEA
Authors	Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier

Comments (0)