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

DOI10.1016/J.CAMWA.2011.07.060zbMATH Open1238.90132OpenAlexW1984491878MaRDI QIDQ418346FDOQ418346

Authors: Quan Shi, Yanghua Xiao, Nik Bessis, Yiqi Lu, Yaoliang Chen, Richard Hill 

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

Recommendations

• Analysis of heuristics for the design of tree networks
• Efficiency of algorithms for solution of network problems with tree-like data structure
• Reconstruction of Kauffman networks applying trees
• Heuristics, LPs, and Trees on Trees: Network Design Analyses
• Efficient algorithms for finding the (k,l)-core of tree networks
• Tree optimization based heuristics and metaheuristics in network construction problems
• An evolutionary approach for finding optimal trees in undirected networks
• Boosting efficiency for computing the Pareto frontier on tree structured networks
• Efficient algorithms for a constrained k-tree core problem in a tree network

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)

Cites Work

• Title not available (Why is that?)
• The Structure and Function of Complex Networks
• Some simplified NP-complete graph problems
• Title not available (Why is that?)
• The structure of scientific collaboration networks
• Min-wise independent permutations

Cited In (1)

• Towards effective social network system implementation

Uses Software

• GraphBase
• Pajek
• Pajek datasets
• WebGraph

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

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