Dual Adjacency Matrix: Exploring Link Groups in Dense Networks

E-ISSN： 1467-8659|34|3|311-320

ISSN： 0167-7055

Source： COMPUTER GRAPHICS FORUM (ELECTRONIC), Vol.34, Iss.3, 2015-06, pp. : 311-320

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

Abstract

Related content

Ring structure digraphs: Spectrum of adjacency matrix and application

By Agaev R. Nikiforov S. Andryushina N.

Automation and Remote Control, Vol. 71, Iss. 6, 2010-06 ,pp. : 1149-1157

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Constructing Permutation Representations for Matrix Groups

By Cooperman G. Finkelstein L. Tselman M. York B.

Journal of Symbolic Computation, Vol. 24, Iss. 3, 1997-09 ,pp. : 471-488

Academic Press

Access to resources Recommend Favorite

Practical Algorithms for Polycyclic Matrix Groups

By Ostheimer G.

Journal of Symbolic Computation, Vol. 28, Iss. 3, 1999-09 ,pp. : 361-379

Academic Press

Access to resources Recommend Favorite

A dual approach to understanding information networks

By Assimakopoulos Dimitris Macdonald Stuart

International Journal of Networking and Virtual Organisations, Vol. 1, Iss. 1, 2003-07 ,pp. : 1-16

Inderscience Publishers

Access to resources Recommend Favorite

Exploring the green features of converged networks

By Yang Xiaodong

International Journal of Internet Protocol Technology, Vol. 6, Iss. 4, 2011-06 ,pp. : 210-216

Inderscience Publishers

Access to resources Recommend Favorite