On reliable graphs with static routing plans

DOI10.1016/0166-218X(94)90103-1zbMath0821.90055WikidataQ128132720 ScholiaQ128132720MaRDI QIDQ1329813

Werner Poguntke

Publication date: 31 July 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

reliable networksrouting plans on graphs

Mathematics Subject Classification ID

Applications of graph theory (05C90) Reliability, availability, maintenance, inspection in operations research (90B25)

Cites Work

• On unreliability polynomials and graph connectivity in reliable network synthesis
• The NP-Completeness of Some Edge-Partition Problems
• Unnamed Item

This page was built for publication: On reliable graphs with static routing plans