✦ LIBER ✦

Separators in Graphs with Negative and Multiple Vertex Weights

✍ Scribed by H. N. Djidjev; J. R. Gilbert

Publisher: Springer
Year: 1999
Tongue: English
Weight: 160 KB
Volume: 23
Category: Article
ISSN: 0178-4617
DOI: 10.1007/pl00009250

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Incorporating negative-weight vertices i

Incorporating negative-weight vertices in certain vertex-search graph algorithms

✍ Glenn K. Manacher; Terrance A. Mankus 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 137 KB

Approximating Steiner trees in graphs wi

Approximating Steiner trees in graphs with restricted weights

✍ Halld�rsson, Magn�s M.; Ueno, Shuichi; Nakao, Hiroshi; Kajitani, Yoji 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 128 KB 👁 2 views

We analyze the approximation ratio of the average distance heuristic for the Steiner tree problem on graphs and prove nearly tight bounds for the cases of complete graphs with binary weights {1, d} or weights in the interval [1, d], where d °2. The improvement over other analyzed algorithms is a fac

Coincidence conditions in multifacility

Coincidence conditions in multifacility location problems with positive and negative weights

✍ Jörg Fliege 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 619 KB

In minisum multifacility location problems one has to find locations for some new facilities, such that the weighted sum of distances between the new and a certain number of old facilities with known locations is minimized. In this kind of problem, the optimal locations of clusters of facilities fre

Hamiltonian cycles and paths in vertex-t

Hamiltonian cycles and paths in vertex-transitive graphs with abelian and nilpotent groups

✍ Marc J. Lipman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 378 KB

In 1968, L. Lovfisz conjectured that every connected, vertex-transitive graph had a Hamiltonian path. In this paper the following results are proved: (1) If a connected graph has a transitive nilpotent group acting on it, then the graph has a Hamiltonian path; (2) a connected, vertex-transitive grap

Approximating Maximum Weight Cycle Cover

Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One

✍ Markus Bläser; Bodo Manthey 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 312 KB

Heavy cycles and spanning trees with few

Heavy cycles and spanning trees with few leaves in weighted graphs

✍ Binlong Li; Shenggui Zhang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 205 KB

Let G be a 2-connected weighted graph and k ≥ 2 an integer. In this note we prove that if the sum of the weighted degrees of every k + 1 pairwise nonadjacent vertices is at least m, then G contains either a cycle of weight at least 2m/(k + 1) or a spanning tree with no more than k leaves.