Evaluating Network Reliability and 2-Edge-Connected Reliability in Linear Time for Bounded Pathwidth Graphs

C. Lucet, J.-F. Manouvrier, J. Carlier

Open source

DOI
10.1007/s004530010022
Published
2000-06-01
Container
Algorithmica
Publisher
Springer Science and Business Media LLC
Open access
unknown

Credibility signals

uncertain Score 64/100 under policy 1.0.0. This is a metadata assessment, not a judgment of the paper's conclusions.

Show all credibility signals

Cite this work

BibTeX

@article{allodium:10.1007/s004530010022,
  title = {Evaluating Network Reliability and 2-Edge-Connected Reliability in Linear Time for Bounded Pathwidth Graphs},
  author = {C. Lucet and J.-F. Manouvrier and J. Carlier},
  year = {2000},
  journal = {Algorithmica},
  doi = {10.1007/s004530010022},
  url = {https://doi.org/10.1007/s004530010022}
}

RIS

TY  - JOUR
TI  - Evaluating Network Reliability and 2-Edge-Connected Reliability in Linear Time for Bounded Pathwidth Graphs
AU  - C. Lucet
AU  - J.-F. Manouvrier
AU  - J. Carlier
PY  - 2000
JO  - Algorithmica
DO  - 10.1007/s004530010022
UR  - https://doi.org/10.1007/s004530010022
ER  - 

APA

Lucet, C., Manouvrier, J., & Carlier, J. (2000). Evaluating Network Reliability and 2-Edge-Connected Reliability in Linear Time for Bounded Pathwidth Graphs. Algorithmica. https://doi.org/10.1007/s004530010022

Source records