๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs

โœ Scribed by Maw-Shang Chang; Yi-Chang Liu

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
475 KB
Volume
48
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

The searchlight guarding problem on weig
The searchlight guarding problem on weighted split graphs and weighted cographs
โœ Yen, William C. K.; Tang, C. Y. ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 223 KB ๐Ÿ‘ 2 views

This paper addresses the searchlight guarding problem, which is an extension of so-called graph searching/guarding problem on a weighted, undirected graph G by considering the time-slot parameter in addition to the traditional building cost. Given a weighted, undirected graph G G G, suppose that the