✦ LIBER ✦

On the approximation of minimum cost homomorphism to bipartite graphs

✍ Scribed by Mastrolilli, Monaldo; Rafiey, Arash

Book ID: 122563665
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 359 KB
Volume: 161
Category: Article
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.05.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An Improved Approximation of the Achroma

An Improved Approximation of the Achromatic Number on Bipartite Graphs

✍ Kortsarz, Guy; Shende, Sunil 📂 Article 📅 2007 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 190 KB

On the eigenvectors belonging to the min

On the eigenvectors belonging to the minimum eigenvalue of an essentially nonnegative symmetric matrix with bipartite graph

✍ Robert Roth 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 602 KB

Approximation of convex curves with appl

Approximation of convex curves with application to the bicriterial minimum cost flow problem

✍ B. Fruhwirth; R.E. Bukkard; G. Rote 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 957 KB

Solution to a conjecture on the maximal

Solution to a conjecture on the maximal energy of bipartite bicyclic graphs

✍ Bofeng Huo; Shengjin Ji; Xueliang Li; Yongtang Shi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 200 KB

Complete solution to a problem on the ma

Complete solution to a problem on the maximal energy of unicyclic bipartite graphs

✍ Bofeng Huo; Xueliang Li; Yongtang Shi 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 197 KB

A solution to Gutman's problem on the ch

A solution to Gutman's problem on the characteristic polynomial of a bipartite graph

✍ Xueliang Li; Heping Zhang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 209 KB

In this short paper, we present a solution to Gutman's problem on the characteristic polynomial of a bipartite graph (Research Problem 134, Discrete Math. 88 (1991)). In [2] I. Gutman proposed a research problem which is stated as follows. The matchings polynomial of a graph G is defined by cl(G,x)