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

The complexity of domination problems in circle graphs

โœ Scribed by J.Mark Keil

Publisher
Elsevier Science
Year
1993
Tongue
English
Weight
854 KB
Volume
42
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Efficient edge domination problems in gr
Efficient edge domination problems in graphs
โœ Dana L. Grinstead; Peter J. Slater; Naveed A. Sherwani; Nancy D. Holmes ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 558 KB
Parallel algorithms for the domination p
Parallel algorithms for the domination problems in trapezoid graphs
โœ Y.Daniel Liang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 608 KB

Trapezoid graphs are a superclass of permutation graphs and interval graphs. This paper presents first parallel algorithms for the independent domination, total domination, connected domination and domination problems in weighted trapezoid graphs. All these algorithms take O(log'n) time on a EREW PR