A linear-time algorithm for computing K-terminal reliability on proper interval graphs

IEEE Transactions on Reliability

Volumn 51, Issue 1, 2002, Pages 58-62

  Lin, Min Sheng ^a  

^a NATIONAL TAIPEI UNIVERSITY OF TECHNOLOGY   (Taiwan)

Author keywords

Design of algorithms; Interval graph; Network reliability; Proper interval graph; Radio broadcast network

Indexed keywords

ALGORITHMS; GRAPH THEORY; INTERCONNECTION NETWORKS; MATHEMATICAL MODELS; PROBABILITY; RADIO BROADCASTING;

INTERVAL GRAPHS; LINEAR TIME ALGORITHM; NETWORK RELIABILITY; PROBABILISTIC GRAPH; RADIO BROADCAST NETWORK;

RELIABILITY;

EID: 0036507951     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/24.994911     Document Type: Article

References (13)

1. Computing 2-terminal reliability for radio-broadcast networks
2. Efficient algorithms for computing the reliability of permutation and interval graphs
3. Physical mapping of chromosomes: A combinatorial problem in molecular biology
4. Simple linear time recognition of unit interval graphs
5. T-colorings of graphs and the channel assignment problem
6. Consecutive retrieval property-Revised
7. A linear-time algorithm for proper interval graph recognition
8. Cluster based routing protocol
9. Indifference graphs
10. On the compatibility between a graph and a simple order
11. A review of current routing protocols for ad hoc mobile wireless networks
12. The complexity of enumeration and reliability problems