A method to cluster the nodes in a directed graph

MaRDI QIDQ2837061zbMATH OpenFDO

Authors I. Hofuku, K. Oshima

Publication date 10 July 2013

Published in Applied Mathematical and Computational Sciences (Search for Journal in Brave)

zbMATH Keywords

directed graphnode clusteringPerron-Frobenius theorem

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph representations (geometric and intersection representations, etc.) (05C62) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Clustering and community detection in directed networks: a survey
• A new method of measuring similarity for a special class of directed graphs
• Clustering algorithm of graphs
• Generating water clusters and other directed graphs
• A method of constructing the frame of a directed graph

Cited in

(3)

• Drawing weighted directed graph from it’s adjacency matrix
• scientific article; zbMATH DE number 4061275 (Why is no real title available?)
• scientific article; zbMATH DE number 7371757 (Why is no real title available?)

This page was built for publication: A method to cluster the nodes in a directed graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2837061)