✦ LIBER ✦

A polynomial transform for matching pairs of weighted graphs

✍ Scribed by H.A. Almohamad

Book ID: 103704910
Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 679 KB
Volume: 15
Category: Article
ISSN: 0307-904X
DOI: 10.1016/0307-904x(91)90011-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational algorithms for matching po

Computational algorithms for matching polynomials of graphs from the characteristic polynomials of edge-weighted graphs

✍ Haruo Hosoya; K. Balasubramanian 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 736 KB

Computational algorithms are described which provide for constructing the set of associated edgeweighted directed graphs such that the average of the characteristic polynomials of the edge-weighted graphs gives the matching polynomial of the parent graph. The weights were chosen to be unities or pur

The matching polynomial of a regular gra

The matching polynomial of a regular graph

✍ Robert A. Beezer; E.J. Farrell 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 588 KB

The matching polynomial of a graph has coefficients that give the number ofmatchings in the graph. For a regular graph, we show it is possible to recover the order, degree, girth and number of minimal cycles from the matching polynomial. If a graph is characterized by its matching polynomial, then i

Weighted Mean of a Pair of Graphs

✍ Horst Bunke; Simon Günter 📂 Article 📅 2001 🏛 Springer Vienna 🌐 English ⚖ 212 KB

A polynomial algorithm for maximum weigh

A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles

✍ Wen-lian Hsu; Yoshiro Ikura; George L. Nemhauser 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 398 KB

A polynomial algorithm for the minimum w

A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs

✍ Wen-Lian HSU; George L. Nemhauser 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 688 KB

Discrete Mathematics 3X ( 19X2) 6S-71 North-Holland Publishing Company 65 Let G = (V, E) be a graph with a positive number wt(v) assigned to each L' E V. A weighted clique saver of the vertices of G is a collection of cliques with a non-negative weight yC. assigned to each clique C in the collection

A survey of heuristics for the weighted

A survey of heuristics for the weighted matching problem

✍ David Avis 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 909 KB

This survey paper reviews results on heuristics for two weighted matching problems: matchings where the vertices are points in the plane and weights are Euclidean distances, and the assignment problem. Several heuristics are described in detail-and results are given for worst-case ratio bounds, abso