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

A unified approach to domination problems on interval graphs

โœ Scribed by G. Ramalingam; C.Pandu Rangan

Book ID
113163221
Publisher
Elsevier Science
Year
1988
Tongue
English
Weight
329 KB
Volume
27
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Deferred-query: An efficient approach fo
Deferred-query: An efficient approach for some problems on interval graphs
โœ Chang, Maw-Shang; Peng, Sheng-Lung; Liaw, Jenn-Liang ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 99 KB ๐Ÿ‘ 2 views

This paper introduces the idea of a deferred-query approach to design O(n) algorithms for the domatic partition, optimal path cover, Hamiltonian path, Hamiltonian circuit, and maximum matching problems on interval graphs given n endpoint-sorted intervals. The previous best-known algorithms run in O(

A unified approach to network location p
A unified approach to network location problems
โœ Nickel, Stefan; Puerto, Justo ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 124 KB ๐Ÿ‘ 2 views

In this paper, we introduce a new type of single-facility location problem on networks which includes as special cases most of the classical criteria in the literature. Structural results as well as a finite dominating set for the optimal locations are developed. Also, the extension to the multifaci