Optimizing K^2 trees: a case for validating the maturity of network of practices
From MaRDI portal
(Redirected from Publication:418346)
Optimizing \(K^2\) trees: a case for validating the maturity of network of practices
Optimizing \(K^2\) trees: a case for validating the maturity of network of practices
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
Cites work
- scientific article; zbMATH DE number 2084315 (Why is no real title available?)
- scientific article; zbMATH DE number 437527 (Why is no real title available?)
- Min-wise independent permutations
- Some simplified NP-complete graph problems
- The Structure and Function of Complex Networks
- The structure of scientific collaboration networks
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)
