A Kernel-based Algorithm for Multilevel Drawing Web Graphs

Xiaodi Huang, Wei Lai, Di Zhang, Mao Lin Huang, Quang Vinh Nguyen

Research output: Book chapter/Published conference paperConference paperpeer-review

1 Citation (Scopus)
9 Downloads (Pure)


A Web graph refers to the graph that models the hyperlink relations between Web pages in the WWW, where a node represents a URL and an edge indicates a link between two URLs. A Web graph is normally a very huge graph. In the course of users' Web exploration, only part of the Web graph is displayed on the screen each time according to a user's current navigation focus. In this paper, we make use of a fast kernel-based algorithm that is able to cluster large graphs. The algorithm is implemented in an online visualization system of Web graphs. In the system, a Web crawler first generates the Web graph of web sites. The clustering algorithm then reduces the visual complexities of the large graph. In particular, it groups a set of highly connected nodes and their edges into a clustered graph with abstract nodes and edges. The experiments have demonstrated that the employed algorithm is able to cluster graphs
Original languageEnglish
Title of host publicationCGIV 2007
Subtitle of host publicationComputer graphics, imaging and visualization: new advances
Place of PublicationUSA
Number of pages6
ISBN (Electronic)0769526063
Publication statusPublished - 2007
EventIEEE International Conference on Computer Graphics, Imaging and Visualisation (CGIV) - Bangkok, Thailand, Thailand
Duration: 14 Aug 200717 Aug 2007


ConferenceIEEE International Conference on Computer Graphics, Imaging and Visualisation (CGIV)


Dive into the research topics of 'A Kernel-based Algorithm for Multilevel Drawing Web Graphs'. Together they form a unique fingerprint.

Cite this