Sciweavers

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

31

CORR
2007
Springer

favoriteEmaildiscussreport

93views Education» more CORR 2007»

Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops

13 years 10 months ago

Complexity of the Minimum Cost Homomorphism Problem for Semicomplete Digraphs with Possible Loops

Download solab.kaist.ac.kr

Eun Jung Kim, Gregory Gutin

Real-time Traffic

CORR 2007 | Education |

claim paper

Related Content

» Minimum Cost Homomorphisms to Locally Semicomplete and QuasiTransitive Digraphs

» Minimum cost homomorphisms to semicomplete multipartite digraphs

» Minimum Cost Homomorphism Dichotomy for Oriented Cycles

» Minimum Cost Homomorphisms to Semicomplete Bipartite Digraphs

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	CORR
Authors	Eun Jung Kim, Gregory Gutin

Comments (0)