Can I read Fast Algorithms for Node-Independent Paths on EtoBox?

Fast Algorithms for Node-Independent Paths by balavr is a document available to read on EtoBox.

What is Fast Algorithms for Node-Independent Paths about?

This document presents an approximation algorithm for finding node-independent paths in networks that improves upon an exact but computationally intractable algorithm. The approximation algorithm provides good lower bounds on the number of node-independent paths between any pair of nodes in worst-case linear time with respect to the graph size. It was found to be over 99% accurate on random graphs and exactly accurate on several real-world networks. The algorithm is demonstrated on two large collaboration a

Author

balavr

Language

EN