Minimal Cuts up to Third Order in a Planar Graph

This paper presents a new algorithm to determine all minimal cuts up to third order that isolate some sink node from all source nodes in a planar graph. The algorithm has the advantage of having a linear complexity, which makes the problem tractable as opposed to path oriented methods, where path de...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on reliability Ročník R-33; číslo 3; s. 250 - 256
Hlavní autor:	Vilar, Julio
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.08.1984 Institute of Electrical and Electronics Engineers
Témata:	Algorithm Application software Applied sciences Computer networks Distributed computing Exact sciences and technology Graph theory Minimal cut sets Operational research and scientific management Operational research. Management science Planar Graph Power distribution Power system modeling Power systems Reliability theory Reliability theory. Replacement problems Set theory Tree graphs Graph theory Reliability Algorithm Planar graph Network
ISSN:	0018-9529, 1558-1721
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!