Cut Set Algorithm of Road Network Reliability

HU A-long · 2004

The paper proposed a method called CSA-CJ which is adapt to find cut sets of huge highway transportation network. The algorithm use a binary digit to divide the vertex set of a non-direction graph, and employ the incident sets of the vertices in the subgraph to produce opposite cut sets.

Read the paper · More papers on PaperTik