TREE 3-SPANNERS ON INTERVAL, PERMUTATION AND REGULAR BIPARTITE GRAPHS

Authors
MADANLAL MS VENKATESAN G RANGAN CP
Citation
Ms. Madanlal et al., TREE 3-SPANNERS ON INTERVAL, PERMUTATION AND REGULAR BIPARTITE GRAPHS, Information processing letters, 59(2), 1996, pp. 97-102
Citations number
5
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
59
Issue
2
Year of publication
1996
Pages
97 - 102
Database
ISI
SICI code
0020-0190(1996)59:2<97:T3OIPA>2.0.ZU;2-G
Abstract
The tree 3-spanner problem consists of finding a tree 3-spanner of a g iven graph G(V, E). We study the tree 3-spanner problem for some speci al classes of graphs namely interval graphs, permutation graphs and re gular bipartite graphs.