A fast successive over-relaxation algorithm for force-directed network graph drawing
Force-directed approach is one of the most widely used methods in graph drawing research. There are two main problems with the traditional force-directed algorithms. First, there is no mature theory to ensure the convergence of iteration sequence used in the algorithm and further, it is hard to esti...
Gespeichert in:
| Veröffentlicht in: | Science China. Information sciences 2012-03, Vol.55 (3), p.677-688 |
|---|---|
| Hauptverfasser: | , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 688 |
|---|---|
| container_issue | 3 |
| container_start_page | 677 |
| container_title | Science China. Information sciences |
| container_volume | 55 |
| creator | Wang, YongXian Wang, ZhengHua |
| description | Force-directed approach is one of the most widely used methods in graph drawing research. There are two main problems with the traditional force-directed algorithms. First, there is no mature theory to ensure the convergence of iteration sequence used in the algorithm and further, it is hard to estimate the rate of convergence even if the convergence is satisfied. Second, the running time cost is increased intolerablely in drawing largescale graphs, and therefore the advantages of the force-directed approach are limited in practice. This paper is focused on these problems and presents a sufficient condition for ensuring the convergence of iterations. We then develop a practical heuristic algorithm for speeding up the iteration in force-directed approach using a successive over-relaxation （SOR） strategy. The results of computational tests on the several benchmark graph datasets used widely in graph drawing research show that our algorithm can dramatically improve the performance of force-directed approach by decreasing both the number of iterations and running time, and is 1.5 times faster than the latter on average. |
| doi_str_mv | 10.1007/s11432-011-4208-9 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1031297070</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><cqvip_id>40952346</cqvip_id><sourcerecordid>1031297070</sourcerecordid><originalsourceid>FETCH-LOGICAL-c375t-409eeab7eb42093c2798963899e281e8214de38d41921804c15469d65db1691d3</originalsourceid><addsrcrecordid>eNp9kE1LxDAQhosoKOoP8Fbx4iWaSdImcxTxCwQvK3gL2XS2W-02a9L149-bZUXBg4GQHJ73neEpiiPgZ8C5Pk8ASgrGAZgS3DDcKvbA1MgAAbfzv9aKaSmfdovDlJ55PlJyoc1eMbkoZy6NZVp5Tyl1b1SGN4osUu8-3NiFoXR9G2I3zhflLMT19cSaLpIfqSkHGt9DfCnb6JbzsonuvRvag2Jn5vpEh9_vfvF4fTW5vGX3Dzd3lxf3zEtdjUxxJHJTTdO8NUovNBqspUEkYYCMANWQNI0CFGC48lCpGpu6aqZQIzRyvzjd9C5jeF1RGu2iS5763g0UVskClyBQc80zevIHfQ6rOOTtrEAwlUaldKZgQ_kYUoo0s8vYLVz8zFV2rdpuVNus2q5VW8wZscmkzA4txd_m_0LH34PmYWhfc-5nUrZSCalq-QWF54q2</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2918579447</pqid></control><display><type>article</type><title>A fast successive over-relaxation algorithm for force-directed network graph drawing</title><source>SpringerLink Journals</source><source>Alma/SFX Local Collection</source><source>ProQuest Central</source><creator>Wang, YongXian ; Wang, ZhengHua</creator><creatorcontrib>Wang, YongXian ; Wang, ZhengHua</creatorcontrib><description>Force-directed approach is one of the most widely used methods in graph drawing research. There are two main problems with the traditional force-directed algorithms. First, there is no mature theory to ensure the convergence of iteration sequence used in the algorithm and further, it is hard to estimate the rate of convergence even if the convergence is satisfied. Second, the running time cost is increased intolerablely in drawing largescale graphs, and therefore the advantages of the force-directed approach are limited in practice. This paper is focused on these problems and presents a sufficient condition for ensuring the convergence of iterations. We then develop a practical heuristic algorithm for speeding up the iteration in force-directed approach using a successive over-relaxation （SOR） strategy. The results of computational tests on the several benchmark graph datasets used widely in graph drawing research show that our algorithm can dramatically improve the performance of force-directed approach by decreasing both the number of iterations and running time, and is 1.5 times faster than the latter on average.</description><identifier>ISSN: 1674-733X</identifier><identifier>EISSN: 1869-1919</identifier><identifier>DOI: 10.1007/s11432-011-4208-9</identifier><language>eng</language><publisher>Heidelberg: SP Science China Press</publisher><subject>Algorithms ; Benchmarking ; Computer Science ; Convergence ; Graphs ; Heuristic methods ; Information Systems and Communication Service ; Iterative methods ; Research Paper ; Running ; Strategy ; 图形绘制 ; 导向 ; 收敛速度 ; 松弛 ; 绘制算法 ; 网络图 ; 过度 ; 迭代序列</subject><ispartof>Science China. Information sciences, 2012-03, Vol.55 (3), p.677-688</ispartof><rights>Science China Press and Springer-Verlag Berlin Heidelberg 2011</rights><rights>Science China Press and Springer-Verlag Berlin Heidelberg 2011.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c375t-409eeab7eb42093c2798963899e281e8214de38d41921804c15469d65db1691d3</citedby><cites>FETCH-LOGICAL-c375t-409eeab7eb42093c2798963899e281e8214de38d41921804c15469d65db1691d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttp://image.cqvip.com/vip1000/qk/84009A/84009A.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s11432-011-4208-9$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/2918579447?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>314,776,780,21367,27901,27902,33721,33722,41464,42533,43781,51294</link.rule.ids></links><search><creatorcontrib>Wang, YongXian</creatorcontrib><creatorcontrib>Wang, ZhengHua</creatorcontrib><title>A fast successive over-relaxation algorithm for force-directed network graph drawing</title><title>Science China. Information sciences</title><addtitle>Sci. China Inf. Sci</addtitle><addtitle>SCIENCE CHINA Information Sciences</addtitle><description>Force-directed approach is one of the most widely used methods in graph drawing research. There are two main problems with the traditional force-directed algorithms. First, there is no mature theory to ensure the convergence of iteration sequence used in the algorithm and further, it is hard to estimate the rate of convergence even if the convergence is satisfied. Second, the running time cost is increased intolerablely in drawing largescale graphs, and therefore the advantages of the force-directed approach are limited in practice. This paper is focused on these problems and presents a sufficient condition for ensuring the convergence of iterations. We then develop a practical heuristic algorithm for speeding up the iteration in force-directed approach using a successive over-relaxation （SOR） strategy. The results of computational tests on the several benchmark graph datasets used widely in graph drawing research show that our algorithm can dramatically improve the performance of force-directed approach by decreasing both the number of iterations and running time, and is 1.5 times faster than the latter on average.</description><subject>Algorithms</subject><subject>Benchmarking</subject><subject>Computer Science</subject><subject>Convergence</subject><subject>Graphs</subject><subject>Heuristic methods</subject><subject>Information Systems and Communication Service</subject><subject>Iterative methods</subject><subject>Research Paper</subject><subject>Running</subject><subject>Strategy</subject><subject>图形绘制</subject><subject>导向</subject><subject>收敛速度</subject><subject>松弛</subject><subject>绘制算法</subject><subject>网络图</subject><subject>过度</subject><subject>迭代序列</subject><issn>1674-733X</issn><issn>1869-1919</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNp9kE1LxDAQhosoKOoP8Fbx4iWaSdImcxTxCwQvK3gL2XS2W-02a9L149-bZUXBg4GQHJ73neEpiiPgZ8C5Pk8ASgrGAZgS3DDcKvbA1MgAAbfzv9aKaSmfdovDlJ55PlJyoc1eMbkoZy6NZVp5Tyl1b1SGN4osUu8-3NiFoXR9G2I3zhflLMT19cSaLpIfqSkHGt9DfCnb6JbzsonuvRvag2Jn5vpEh9_vfvF4fTW5vGX3Dzd3lxf3zEtdjUxxJHJTTdO8NUovNBqspUEkYYCMANWQNI0CFGC48lCpGpu6aqZQIzRyvzjd9C5jeF1RGu2iS5763g0UVskClyBQc80zevIHfQ6rOOTtrEAwlUaldKZgQ_kYUoo0s8vYLVz8zFV2rdpuVNus2q5VW8wZscmkzA4txd_m_0LH34PmYWhfc-5nUrZSCalq-QWF54q2</recordid><startdate>20120301</startdate><enddate>20120301</enddate><creator>Wang, YongXian</creator><creator>Wang, ZhengHua</creator><general>SP Science China Press</general><general>Springer Nature B.V</general><scope>2RA</scope><scope>92L</scope><scope>CQIGP</scope><scope>W92</scope><scope>~WA</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>P5Z</scope><scope>P62</scope><scope>PHGZM</scope><scope>PHGZT</scope><scope>PKEHL</scope><scope>PQEST</scope><scope>PQGLB</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>7SC</scope><scope>8FD</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20120301</creationdate><title>A fast successive over-relaxation algorithm for force-directed network graph drawing</title><author>Wang, YongXian ; Wang, ZhengHua</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c375t-409eeab7eb42093c2798963899e281e8214de38d41921804c15469d65db1691d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Algorithms</topic><topic>Benchmarking</topic><topic>Computer Science</topic><topic>Convergence</topic><topic>Graphs</topic><topic>Heuristic methods</topic><topic>Information Systems and Communication Service</topic><topic>Iterative methods</topic><topic>Research Paper</topic><topic>Running</topic><topic>Strategy</topic><topic>图形绘制</topic><topic>导向</topic><topic>收敛速度</topic><topic>松弛</topic><topic>绘制算法</topic><topic>网络图</topic><topic>过度</topic><topic>迭代序列</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, YongXian</creatorcontrib><creatorcontrib>Wang, ZhengHua</creatorcontrib><collection>中文科技期刊数据库</collection><collection>中文科技期刊数据库-CALIS站点</collection><collection>中文科技期刊数据库-7.0平台</collection><collection>中文科技期刊数据库-工程技术</collection><collection>中文科技期刊数据库- 镜像站点</collection><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection (ProQuest)</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central (New)</collection><collection>ProQuest One Academic (New)</collection><collection>ProQuest One Academic Middle East (New)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Applied & Life Sciences</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Science China. Information sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wang, YongXian</au><au>Wang, ZhengHua</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A fast successive over-relaxation algorithm for force-directed network graph drawing</atitle><jtitle>Science China. Information sciences</jtitle><stitle>Sci. China Inf. Sci</stitle><addtitle>SCIENCE CHINA Information Sciences</addtitle><date>2012-03-01</date><risdate>2012</risdate><volume>55</volume><issue>3</issue><spage>677</spage><epage>688</epage><pages>677-688</pages><issn>1674-733X</issn><eissn>1869-1919</eissn><abstract>Force-directed approach is one of the most widely used methods in graph drawing research. There are two main problems with the traditional force-directed algorithms. First, there is no mature theory to ensure the convergence of iteration sequence used in the algorithm and further, it is hard to estimate the rate of convergence even if the convergence is satisfied. Second, the running time cost is increased intolerablely in drawing largescale graphs, and therefore the advantages of the force-directed approach are limited in practice. This paper is focused on these problems and presents a sufficient condition for ensuring the convergence of iterations. We then develop a practical heuristic algorithm for speeding up the iteration in force-directed approach using a successive over-relaxation （SOR） strategy. The results of computational tests on the several benchmark graph datasets used widely in graph drawing research show that our algorithm can dramatically improve the performance of force-directed approach by decreasing both the number of iterations and running time, and is 1.5 times faster than the latter on average.</abstract><cop>Heidelberg</cop><pub>SP Science China Press</pub><doi>10.1007/s11432-011-4208-9</doi><tpages>12</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1674-733X |
| ispartof | Science China. Information sciences, 2012-03, Vol.55 (3), p.677-688 |
| issn | 1674-733X 1869-1919 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1031297070 |
| source | SpringerLink Journals; Alma/SFX Local Collection; ProQuest Central |
| subjects | Algorithms Benchmarking Computer Science Convergence Graphs Heuristic methods Information Systems and Communication Service Iterative methods Research Paper Running Strategy 图形绘制 导向 收敛速度 松弛 绘制算法 网络图 过度 迭代序列 |
| title | A fast successive over-relaxation algorithm for force-directed network graph drawing |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-19T00%3A43%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20fast%20successive%20over-relaxation%20algorithm%20for%20force-directed%20network%20graph%20drawing&rft.jtitle=Science%20China.%20Information%20sciences&rft.au=Wang,%20YongXian&rft.date=2012-03-01&rft.volume=55&rft.issue=3&rft.spage=677&rft.epage=688&rft.pages=677-688&rft.issn=1674-733X&rft.eissn=1869-1919&rft_id=info:doi/10.1007/s11432-011-4208-9&rft_dat=%3Cproquest_cross%3E1031297070%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2918579447&rft_id=info:pmid/&rft_cqvip_id=40952346&rfr_iscdi=true |