Estimating the Number of s-t Paths in a Graph
From MaRDI portal
Publication:5301411
DOI10.7155/JGAA.00142zbMATH Open1161.68696OpenAlexW2122595065WikidataQ118141948 ScholiaQ118141948MaRDI QIDQ5301411FDOQ5301411
Authors: Ben Roberts, Dirk P. Kroese 
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
Recommendations
- Approximately Counting Hamilton Paths and Cycles in Dense Graphs
- Fast sequential importance sampling to estimate the graph reliability polynomial
- A LOWER BOUND OF THE EXPECTED MAXIMUM NUMBER OF VERTEX-DISJOINT s-t PATHS ON PROBABILISTIC GRAPHS
- On the number of paths and cycles for almost all graphs and digraphs
- Stochastic enumeration method for counting trees
Cited In (8)
- On sampling simple paths in planar graphs according to their lengths
- Exact localisations of feedback sets
- Stochastic enumeration method for counting NP-hard problems
- Generalized bounded rationality and robust multicommodity network design
- Methods for determining cycles of a specific length in undirected graphs with edge weights
- On the estimate of the size of a directed graph
- Cognitively-constrained learning from neighbors
- On computing the path number of a graph
This page was built for publication: Estimating the Number of s-t Paths in a Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5301411)
