A cut-based method for terminal-pair reliability

This paper assesses two categories of partition techniques for computing terminal-pair reliability (path-based and cut-based algorithms) by experimenting on published benchmarks; the criteria are the number of subproblems and the computation time. The cut-based algorithm is superior to the path-base...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on reliability Vol. 45; no. 3; pp. 413 - 416
Main Authors Chen, Y.G., Yuang, M.C.
Format Journal Article
LanguageEnglish
Published New York, NY IEEE 01.09.1996
Institute of Electrical and Electronics Engineers
Subjects
Online AccessGet full text
ISSN0018-9529
DOI10.1109/24.536994

Cover

Abstract This paper assesses two categories of partition techniques for computing terminal-pair reliability (path-based and cut-based algorithms) by experimenting on published benchmarks; the criteria are the number of subproblems and the computation time. The cut-based algorithm is superior to the path-based algorithm with respect to the computation time for most benchmarks. A refinement of the cut-based algorithm (using network reduction) profoundly outperforms the path-based algorithm (with reduction) for all benchmarks.
AbstractList This paper assesses two categories of partition techniques for computing terminal-pair reliability (path-based and cut-based algorithms) by experimenting on published benchmarks; the criteria are the number of subproblems and the computation time. The cut-based algorithm is superior to the path-based algorithm with respect to the computation time for most benchmarks. A refinement of the cut-based algorithm (using network reduction) profoundly outperforms the path-based algorithm (with reduction) for all benchmarks
This paper assesses two categories of partition techniques for computing terminal-pair reliability (path-based and cut-based algorithms) by experimenting on published benchmarks; the criteria are the number of subproblems and the computation time. The cut-based algorithm is superior to the path-based algorithm with respect to the computation time for most benchmarks. A refinement of the cut-based algorithm (using network reduction) profoundly outperforms the path-based algorithm (with reduction) for all benchmarks.
Author Yuang, M.C.
Chen, Y.G.
Author_xml – sequence: 1
  givenname: Y.G.
  surname: Chen
  fullname: Chen, Y.G.
  organization: Nat. Chiao Tung Univ., Hsinchu, Taiwan
– sequence: 2
  givenname: M.C.
  surname: Yuang
  fullname: Yuang, M.C.
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=3237264$$DView record in Pascal Francis
BookMark eNqF0D1PwzAQBmAPRaItDKxMGRASQ1p_pP4Yq4oCUiUWmC3HOQsjJym2O_TfE5TCgJCYTqd73ne4GZp0fQcIXRG8IASrJa0WK8aVqiZoijGRpVpRdY5mKb0Pa1UpOUV4XdhDLmuToClayG99U7g-Fhli6zsTyr3xsYgQvKl98Pl4gc6cCQkuT3OOXrf3L5vHcvf88LRZ70rLmBgKgVjrLKMNOMksd0w6i7kwjkiLFaeCKdJIcLhemZpTTqzAnCoJpgGqHJuj27F3H_uPA6SsW58shGA66A9JU0UEZ4L-DyVlRAoxwJsTNMma4KLprE96H31r4lEzOrTxamDLkdnYpxTBaeuzyb7vcjQ-aIL113c1rfT43SFx9yvx3fmXvR6tB4Afdzp-Avr1hOQ
CODEN IERQAD
CitedBy_id crossref_primary_10_1109_TR_2008_2006293
crossref_primary_10_1007_s11803_012_0093_5
crossref_primary_10_1016_j_epsr_2009_04_005
crossref_primary_10_1016_S0898_1221_00_00204_2
crossref_primary_10_1109_71_762814
crossref_primary_10_1109_24_799845
crossref_primary_10_1109_TR_2014_2299673
crossref_primary_10_1002_qre_1772
crossref_primary_10_1016_j_comcom_2021_02_004
crossref_primary_10_1016_j_camwa_2010_09_033
crossref_primary_10_1016_j_entcs_2012_11_015
crossref_primary_10_1016_S0164_1212_01_00023_1
crossref_primary_10_1109_TR_2007_896770
crossref_primary_10_1109_24_935023
crossref_primary_10_1016_S0951_8320_98_00096_9
crossref_primary_10_1109_71_993209
crossref_primary_10_1016_j_ress_2005_11_006
crossref_primary_10_1109_TR_2019_2935630
crossref_primary_10_1109_TR_2021_3075577
crossref_primary_10_1016_S0898_1221_00_00166_8
crossref_primary_10_1016_j_microrel_2013_08_001
crossref_primary_10_1109_TR_2009_2028090
crossref_primary_10_1109_TR_2006_884595
ContentType Journal Article
Copyright 1996 INIST-CNRS
Copyright_xml – notice: 1996 INIST-CNRS
DBID AAYXX
CITATION
IQODW
7SC
8FD
JQ2
L7M
L~C
L~D
7TB
FR3
DOI 10.1109/24.536994
DatabaseName CrossRef
Pascal-Francis
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Mechanical & Transportation Engineering Abstracts
Engineering Research Database
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
Mechanical & Transportation Engineering Abstracts
Engineering Research Database
DatabaseTitleList Computer and Information Systems Abstracts
Technology Research Database

DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Applied Sciences
EndPage 416
ExternalDocumentID 3237264
10_1109_24_536994
536994
GroupedDBID -~X
.DC
0R~
29I
4.4
5GY
5VS
6IK
8WZ
97E
A6W
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFO
ACGFS
ACIWK
ACNCT
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
EBS
EJD
H~9
IAAWW
IBMZZ
ICLAB
IDIHD
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
OCL
P2P
RIA
RIE
RNS
TN5
VH1
VJK
AAYXX
CITATION
IQODW
RIG
7SC
8FD
JQ2
L7M
L~C
L~D
7TB
FR3
ID FETCH-LOGICAL-c337t-be1ccfc32def83c6f38fc067af18c09627391d8ef0b5ab6261c706298eade29f3
IEDL.DBID RIE
ISSN 0018-9529
IngestDate Sun Sep 28 03:05:36 EDT 2025
Sat Sep 27 17:51:25 EDT 2025
Mon Jul 21 09:12:37 EDT 2025
Wed Oct 01 01:27:07 EDT 2025
Thu Apr 24 23:01:34 EDT 2025
Tue Aug 26 20:48:47 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Keywords Partition
System reliability
Performance
Algorithm
Comparative study
Network
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c337t-be1ccfc32def83c6f38fc067af18c09627391d8ef0b5ab6261c706298eade29f3
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
PQID 28231877
PQPubID 23500
PageCount 4
ParticipantIDs proquest_miscellaneous_29176372
pascalfrancis_primary_3237264
crossref_citationtrail_10_1109_24_536994
ieee_primary_536994
proquest_miscellaneous_28231877
crossref_primary_10_1109_24_536994
ProviderPackageCode CITATION
AAYXX
PublicationCentury 1900
PublicationDate 1996-09-01
PublicationDateYYYYMMDD 1996-09-01
PublicationDate_xml – month: 09
  year: 1996
  text: 1996-09-01
  day: 01
PublicationDecade 1990
PublicationPlace New York, NY
PublicationPlace_xml – name: New York, NY
PublicationTitle IEEE transactions on reliability
PublicationTitleAbbrev TR
PublicationYear 1996
Publisher IEEE
Institute of Electrical and Electronics Engineers
Publisher_xml – name: IEEE
– name: Institute of Electrical and Electronics Engineers
SSID ssj0014498
Score 1.6351492
Snippet This paper assesses two categories of partition techniques for computing terminal-pair reliability (path-based and cut-based algorithms) by experimenting on...
SourceID proquest
pascalfrancis
crossref
ieee
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 413
SubjectTerms Applied sciences
Bioreactors
Boolean algebra
Computer networks
Exact sciences and technology
Operational research and scientific management
Operational research. Management science
Partitioning algorithms
Performance gain
Reliability theory. Replacement problems
Title A cut-based method for terminal-pair reliability
URI https://ieeexplore.ieee.org/document/536994
https://www.proquest.com/docview/28231877
https://www.proquest.com/docview/29176372
Volume 45
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  issn: 0018-9529
  databaseCode: RIE
  dateStart: 19630101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://ieeexplore.ieee.org/
  omitProxy: false
  ssIdentifier: ssj0014498
  providerName: IEEE
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3PT8IwFG6Ekx78gRpR0cV48DLo2m5tj8RIiImeJOG2dG9tQiRAYDvoX2-7DiJKjLdle-uy99q-176v30PoHsBwgYUJTRbFIZM5DjMDMjQaZ8CIyii4fciX12Q4Ys_jeFzzbFdnYbTWFfhMd91llcvP51C6rbJeTBMpWQM1uEj8Ua1NwoAxWU-6dvzGRNYkQhGWPcK6_sUt11PVUnFISLWyyjC-isWvCbnyMoMjf3x7VZETOnDJe7cssi58_qBu_OcPHKPDOtoM-r57nKA9PWuhg28chKcI9wMoi9B5szzw9aQDG8gGNUpmGi7UZBks9XTiGb0_ztBo8PT2OAzrMgohUMptAzqyFgFKcm0EhcRQYcA6KWUiAdgV36EyyoU2OItVZhc4EXCcECkclppIQ89Rczaf6QsUOO5EFlsTUlBMUa5scKJzzhOpQcYQtdHDWsMp1BzjrtTFNK3WGlimhKVeCW10txFdeGKNXUItp8SNwPpuZ8tqm8eUUG4DvDa6XVsxtYPFZUDUTM_LVUpc0lNw_oeEXb4mtpXLnV--Qvsete0wZteoWSxL3bFBSZHdVN3xC77s4Jc
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV07T8MwELagDMDAG1GgNEIMLCmOH3E8IkRVnlMrdYuciy1VVG3VNgP8euw4rXhUiC1KLo5yZ_vOvs_fIXQFYESCExOaLOIhkzkOMwMyNBpnwIjKKLh9yJfXuNNjj33er3i2y7MwWusSfKZb7rLM5edjKNxW2Q2nsZRsHW1wxhj3h7WWKQPGZDXt2hHMiaxohCIsbwhr-Ve_OZ-ymorDQqqZVYfxdSx-Tcmln2nv-gPcs5Ke0MFL3lrFPGvBxw_yxn_-wh7aqeLN4NZ3kH20pkcHaPsLC-EhwrcBFPPQ-bM88BWlAxvKBhVOZhhO1GAaTPVw4Dm9349Qr33fveuEVSGFECgVtgEdWZsAJbk2CYXY0MSAdVPKRAlgV36HyihPtMEZV5ld4kQgcExk4tDURBp6jGqj8UifoMCxJzJujUhBMUWFsuGJzoWIpQbJIaqj64WGU6hYxl2xi2FarjawTAlLvRLq6HIpOvHUGquEDpwSlwKLu41vVls-poQKG-LVUXNhxdQOF5cDUSM9LmYpcWnPRIg_JOwCNratnK78chNtdrovz-nzw-vTGdryGG6HODtHtfm00A0bosyzi7JrfgKmKuPk
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+cut-based+method+for+terminal-pair+reliability&rft.jtitle=IEEE+transactions+on+reliability&rft.au=Chen%2C+Y.G.&rft.au=Yuang%2C+M.C.&rft.date=1996-09-01&rft.pub=IEEE&rft.issn=0018-9529&rft.volume=45&rft.issue=3&rft.spage=413&rft.epage=416&rft_id=info:doi/10.1109%2F24.536994&rft.externalDocID=536994
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9529&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9529&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9529&client=summon