Network reliability analysis and intractability of counting diameter crystal graphs

Consider a stochastic network, where nodes are perfect but links fail independently, ruled by failure probabilities. Additionally, we are given distinguished nodes, called terminals, and a positive integer, called diameter. The event under study is to connect terminals by paths not longer than the g...

Ful tanımlama

Detaylı Bibliyografya

Yazar:	Canale, Eduardo (author)
Diğer Yazarlar:	Robledo, Franco (author), Romero, Pablo (author), Rubino, Gerardo (author)
Materyal Türü:	report
Dil:	İngilizce
Baskı/Yayın Bilgisi:	2016
Konular:	Computational complexity Network reliability Diameter-critical graphs
Online Erişim:	http://hdl.handle.net/20.500.12008/9204
Etiketler:	Etiketle Etiket eklenmemiş, İlk siz ekleyin!