DSpace Repository

Browsing by Subject "Shortest path, pruning, graph algorithms"

Browsing by Subject "Shortest path, pruning, graph algorithms"

Sort by: Order: Results:

  • Khamayseh, Faisal; Arman, Nabil (Proceedings of the International Conference on Intelligent Systems and Applications (ICISA'2014), 2014-03-22)
    Given a graph G=(V,E,w), where Vand E are finite set of vertices and edges respectively, in a directed weighted graph G with weights denoted by w(e)>0 for each edge e∈ E. Given two vertices <s> and <t>∈ V, P(s,t) is the ...

Search DSpace

Browse

My Account