scientific article; zbMATH DE number 5005302

MaRDI QIDQ3369027zbMATH OpenFDO

Authors Dragan Urošević, Nenad Mladenović

Publication date 13 February 2006

zbMATH Keywords

weighted graph

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Variable neighborhood search for the vertex weighted \(k\)-cardinality tree problem
• Variable neighborhood decomposition search for the edge weighted k-cardinality tree problem
• Local and variable neighborhood search for the k -cardinality subgraph problem
• Variable neighbourhood search for the k-labelled spanning forest problem
• Variable neighborhood search for the heaviest \(k\)-subgraph
• Variable neighborhood search for the degree-constrained minimum spanning tree problem
• General variable neighborhood search for the minimum stretch spanning tree problem
• General variable neighborhood search for computing graph separators
• Variable neighborhood search for extremal graphs.17. Further conjectures and results about the index
• Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems

Cited in

(2)

• Variable neighborhood programming for symbolic regression
• Efficientk-NN graph construction for graphs on variables

This page was built for publication:

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