Sciweavers

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

113

APPROX
2006
Springer

103views Algorithms» more APPROX 2006»

Approximation Algorithms for Graph Homomorphism Problems

15 years 6 months ago

Approximation Algorithms for Graph Homomorphism Problems

Download www.math.uwaterloo.ca

Michael Langberg, Yuval Rabani, Chaitanya Swamy

Real-time Traffic

Algorithms | APPROX 2006 |

claim paper

Related Content

» Graph Homomorphism Revisited for Graph Matching

» Exact Algorithms for Graph Homomorphisms

» New PlainExponential Time Classes for Graph Homomorphism

» Graphbased object tracking

» Approximating the minimum clique cover and other hard problems in subtree filament graphs

» On the Complexity of Ordered Colorings

» The Dichotomy of List Homomorphisms for Digraphs

» Minimum Cost Homomorphism Dichotomy for Oriented Cycles

» Attributed Tree Homomorphism Using Association Graphs

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	APPROX
Authors	Michael Langberg, Yuval Rabani, Chaitanya Swamy

Comments (0)