Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula.
Marlowe, Thomas J.; Schoppmann, Laura
Mathematical Problems in Engineering (1998)
- Volume: 4, Issue: 3, page 247-266
- ISSN: 1024-123X
Access Full Article
top
How to cite
topMarlowe, Thomas J., and Schoppmann, Laura. "Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula.." Mathematical Problems in Engineering 4.3 (1998): 247-266. <http://eudml.org/doc/48486>.
@article{Marlowe1998,
author = {Marlowe, Thomas J., Schoppmann, Laura},
journal = {Mathematical Problems in Engineering},
keywords = {computational complexity; efficient recursive algorithms; networks; reliability; threshold graphs; Gilbert's formula; graphs; polynomial-time computations},
language = {eng},
number = {3},
pages = {247-266},
publisher = {Hindawi Publishing Corporation, New York},
title = {Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula.},
url = {http://eudml.org/doc/48486},
volume = {4},
year = {1998},
}
TY - JOUR
AU - Marlowe, Thomas J.
AU - Schoppmann, Laura
TI - Polynomial-time computability of the edge-reliability of graphs using Gilbert's formula.
JO - Mathematical Problems in Engineering
PY - 1998
PB - Hindawi Publishing Corporation, New York
VL - 4
IS - 3
SP - 247
EP - 266
LA - eng
KW - computational complexity; efficient recursive algorithms; networks; reliability; threshold graphs; Gilbert's formula; graphs; polynomial-time computations
UR - http://eudml.org/doc/48486
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.