Drawing Power Law Graphs Using a Local/Global Decomposition

Author： Andersen Reid Chung Fan Lu Linyuan

ISSN： 0178-4617

Source： Algorithmica, Vol.47, Iss.4, 2007-05, pp. : 397-397

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Verification of distributed systems with local-global predicates

By Chandy K.

Formal Aspects of Computing, Vol. 23, Iss. 5, 2011-09 ,pp. : 649-679

Springer Publishing Company

Access to resources Recommend Favorite

Power law-based local search in differential evolution

By Sharma Harish

International Journal of Computational Intelligence Studies, Vol. 2, Iss. 2, 2013-07 ,pp. : 90-112

Inderscience Publishers

Access to resources Recommend Favorite

Guest Editorial: Global modeling using local patterns

By Fürnkranz Johannes Knobbe Arno

Data Mining and Knowledge Discovery, Vol. 21, Iss. 1, 2010-07 ,pp. : 1-8

Springer Publishing Company

Access to resources Recommend Favorite

Schnyder Decompositions for Regular Plane Graphs and Application to Drawing

By Bernardi Olivier Fusy Éric

Algorithmica, Vol. 62, Iss. 3-4, 2012-04 ,pp. : 1159-1197

Springer Publishing Company

Access to resources Recommend Favorite

Towards area requirements for drawing hierarchically planar graphs

By Lin X. Eades P.

Theoretical Computer Science, Vol. 292, Iss. 3, 2003-01 ,pp. : 679-695

Elsevier

Access to resources Recommend Favorite