I have a network with 500 nodes and 400 edges. Iam interested in the pathways between 2 nodes and for that i have calculated all the shortest paths between that 2 nodes. To test experimentally, i need to select/predict "important" pathways, as testing all shortest paths will be laborious, and right now Iam using graph-theoretic measures like betweenness centrality, maximum indegree and outdegree of the nodes in my shortest paths and filtering the ones which have lower value.
Do you think this is enough/appropriate or are there any other ways that i can select/predict the "important" pathways which i can test experimentally?