Output details
11 - Computer Science and Informatics
University of Westminster
Article title
Largest connected component of a star graph with faulty vertices
Type
D - Journal article
Title of journal
International Journal of Computer Mathematics
Article number
-
Volume number
85
Issue number
12
First page of article
1771
ISSN of journal
0020-7160
Year of publication
2008
Number of additional authors
3
Additional information
<12> This paper adds the theoretical underpinning of Fault tolerant computing: it is vital for modern large scale computing architectures where the likelihood is that somewhere there will always be a fault. The paper the largest connected component or usable piece of hardware in a system which has significant impact on automatic recovery in the presence of faults; a ubiquitous and relevant problem in parallel and distributed computing. The contribution is the demonstration the feasibility of finding the largest connected component with a rigorous proof of the method together with a suggested algorithm.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
10
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
