WEIGHTED IRREDUNDANCE OF INTERVAL-GRAPHS

Authors
CHANG MS NAGAVAMSI P RANGAN CP
Citation
Ms. Chang et al., WEIGHTED IRREDUNDANCE OF INTERVAL-GRAPHS, Information processing letters, 66(2), 1998, pp. 65-70
Citations number
17
Categorie Soggetti
Computer Science Information Systems","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
66
Issue
2
Year of publication
1998
Pages
65 - 70
Database
ISI
SICI code
0020-0190(1998)66:2<65:WIOI>2.0.ZU;2-3
Abstract
An O(n(3)) algorithm for finding a minimum weighted maximal irredundan t set of interval graphs with n vertices is presented. (C) 1998 Elsevi er Science B.V.