RECOGNITION ALGORITHM FOR INTERSECTION GRAPHS OF EDGE-DISJOINT PATHS IN A TREE

Authors
PANDA BS MOHANTY SP
Citation
Bs. Panda et Sp. Mohanty, RECOGNITION ALGORITHM FOR INTERSECTION GRAPHS OF EDGE-DISJOINT PATHS IN A TREE, Information processing letters, 49(3), 1994, pp. 139-143
Citations number
26
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
49
Issue
3
Year of publication
1994
Pages
139 - 143
Database
ISI
SICI code
0020-0190(1994)49:3<139:RAFIGO>2.0.ZU;2-P
Abstract
We present several characterizations of intersection graphs of edge-di sjoint paths in a tree. We suggest a linear time sequential algorithm and a parallel NC algorithm for recognition and for construction of an intersection model for these graphs.