Generation of K-Trees of undirected graphs

Author

Patvardhan, C. ; Prasad, V.C. ; Pyara, V. Prem

Author_Institution

Dayalbagh Educ. Inst., Agra, India

Volume

46

Issue

2

fYear

1997

fDate

6/1/1997 12:00:00 AM

Firstpage

208

Lastpage

211

Abstract

Evaluating the reliability of a network with multiple sources and multiple terminals and unreliable vertices and edges can be converted into a single-source problem and solved using K-Trees. This paper presents an efficient algorithm (GenK-Trees) for enumerating all the K-Trees in an undirected graph. This is the first algorithm with polynomial complexity per K-Tree generated. Formal proofs of the correctness of GenK-Trees and its complexity are given. GenK-Trees is computationally simple, and easy to understand and program; its memory requirements are small, and so it can handle large graphs without running into memory limitations

Keywords

graph theory; polynomials; reliability theory; GenK-Trees algorithm; K-Trees generation; memory requirements; multiple sources; multiple terminals; network reliability evaluation; polynomial complexity; single-source problem; undirected graphs; unreliable edges; unreliable vertices; Application software; Computer applications; Computer networks; Educational technology; Fault tolerant systems; Multiprocessing systems; Polynomials; Reliability theory; Tree graphs;

fLanguage

English

Journal_Title

Reliability, IEEE Transactions on

Publisher

ieee

ISSN

0018-9529

Type

jour

DOI

10.1109/24.589948

Filename

589948