Optimizing \(K^2\) trees: a case for validating the maturity of network of practices

DOI10.1016/j.camwa.2011.07.060zbMath1238.90132OpenAlexW1984491878MaRDI QIDQ418346

J. Herrera, H. S. Yoon

Publication date: 28 May 2012

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2011.07.060

zbMATH Keywords

compression algorithm\(K^{2}\) treeDFS codenetwork of practicesstorage optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Social networks; opinion dynamics (91D30) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Database theory (68P15) Internet topics (68M11)

Uses Software

• GraphBase
• Pajek
• Pajek datasets
• WebGraph

Cites Work

• Some simplified NP-complete graph problems
• Min-wise independent permutations
• From the Cover: The structure of scientific collaboration networks
• The Structure and Function of Complex Networks
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimizing \(K^2\) trees: a case for validating the maturity of network of practices