I had crawled a million page from en.wiktionary.org and each word in a page become vertex and its hyperlinked relation become directed edges.
I'd like to split this directed non-weighted graph disjointly so that I could make search process faster on this graph.
What kind of algorithms and criterias have been researched upon graph dissection?
I don't know name that the academia use to call this dissecting algorithm and relevant research field.
Please let me know if you know any clues.