1. A method for information retrieval in semantic networks, comprising: acquiring a graph of interest; assuming a metric regarding the acquired graph, wherein said metric assigns to each edge in the acquired graph a weight that is dependent on degrees of its endpoints; specifying a query node of interest on the acquired graph; calculating a shortest-path distance from the query node of interest to a plurality of other nodes on the acquired graph; obtaining a ranked list of nodes based on the calculated shortest-path distance, and displaying for a user the retrieved information.
1. A method for information retrieval in semantic networks, comprising: acquiring a graph of interest; assuming a metric regarding the acquired graph, wherein said metric assigns to each edge in the acquired graph a weight that is dependent on degrees of its endpoints; specifying a query node of interest on the acquired graph; calculating a shortest-path distance from the query node of interest to a plurality of other nodes on the acquired graph; obtaining a ranked list of nodes based on the calculated shortest-path distance, and displaying for a user the retrieved information. 7. The method for information retrieval in semantic networks according to claim 1 , wherein the shortest-path distance from the query node to all other nodes for the first task is computed using Dijkstra algorithm.