Patent Document ID: 7882105
Application ID: 11492458

Base Claim:
1. A method of computerized sorting of a set of electronic documents of the type possibly containing hypertext links to other electronic documents, the method comprising: a) analyzing the set of electronic documents to detect presence of the hypertext links and to construct a graph representing said set of electronic documents, each vertex of the graph corresponding to one of the electronic documents of said set, and an edge between two vertices of the graph indicating the presence of at least one hypertext link between the two electronic documents corresponding to said two vertices; b) obtaining a minor M G of the graph G comprising a predefined maximum number N of vertices by deleting at least one vertex of the graph G to minimize a predefined distance between said graph G and said minor M G for said predefined number N of vertices by taking into account a neighborhood of all vertices of the graph G, said distance measuring perturbation of the neighborhood of the vertices of the graph G that is engendered by the generation of the minor M G of the graph; and c) determining a subset of said set of electronic documents which corresponds to the vertices of the minor M G of the graph.

---

Claim 2:
2. The method as claimed in claim 1 , wherein step b) includes a step of processing the graph G by an iterative process, each iteration comprising generating a minor M i+1 of a current minor M i of the graph by deletion from the current minor M i of the graph of at least one vertex v satisfying a predefined criterion relating to a comparison of its neighborhood in the current minor M i of the graph and of its neighborhood in the constructed graph G, the iterative process ending when the number of vertices of the current minor M i of the graph becomes less than or equal to N.