Estimating the Number of s-t Paths in a Graph
From MaRDI portal
Publication:5301411
DOI10.7155/jgaa.00142zbMath1161.68696OpenAlexW2122595065WikidataQ118141948 ScholiaQ118141948MaRDI QIDQ5301411
Publication date: 19 January 2009
Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: http://www.emis.de/journals/JGAA/accepted/2007/RobertsKroese2007.11.1.pdf
Related Items
Stochastic enumeration method for counting NP-hard problems, On Sampling Simple Paths in Planar Graphs According to Their Lengths, Methods for determining cycles of a specific length in undirected graphs with edge weights, Exact localisations of feedback sets, Cognitively-constrained learning from neighbors, Generalized Bounded Rationality and Robust Multicommodity Network Design