A LOWER BOUND OF THE EXPECTED MAXIMUM NUMBER OF VERTEX-DISJOINT s-t PATHS ON PROBABILISTIC GRAPHS
type: Item
instance of: scholarly article
title: A LOWER BOUND OF THE EXPECTED MAXIMUM NUMBER OF VERTEX-DISJOINT s-t PATHS ON PROBABILISTIC GRAPHS
zbMATH Open document ID: 0817.90025
author: Peng Cheng
author: Shigeru Masuyama
published in: Journal of the Operations Research Society of Japan
publication date: 1995-08-01T00:00:00Z
Mathematics Subject Classification ID: 90B15
zbMATH DE Number: 713375
zbMATH Keywords: probabilistic graph
zbMATH Keywords: two-terminal graph
zbMATH Keywords: NP-hard
zbMATH Keywords: lower obund
MaRDI profile type: Publication
full work available at URL: jorsj.37.96
OpenAlex ID: W1527020199
DOI: 10.15807/JORSJ.37.96
description: scientific article; zbMATH DE number 713375