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.
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. 8. The method as claimed in claim 1 , further comprising: processing the graph G by a second iterative process, each iteration including generating a second graph G i+1 based on a current graph G i , by deletion from the current graph G i of any vertex which belongs to the minor M G i the current graph, obtained by application of step b) to the current graph G i , and which satisfies a second predefined criterion pertaining to its neighborhood in this minor M i of the graph, said second iterative process ending when the current graph G i is empty; and determining, for each minor M G i , the current graph obtained, a subset of said set of documents corresponding to the vertices of the obtained minor M G i of the current graph.