Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Competitive decision algorithm for the degree-constrained minimum spanning tree

From MaRDI portal
Publication:3418809
Jump to:navigation, search

zbMATH Open1151.90465MaRDI QIDQ3418809FDOQ3418809


Authors: Aibing Ning, Liang Ma Edit this on Wikidata


Publication date: 26 January 2007





Recommendations

  • The cellular competitive decision algorithm for the degree-constrained minimum spanning tree problem
  • An optimization algorithm for solving degree-constrained minimum spanning tree problems
  • Comparison of algorithms for the degree constrained minimum spanning tree
  • Novel degree constrained minimum spanning tree algorithm based on an improved multicolony ant algorithm
  • scientific article; zbMATH DE number 1054929


zbMATH Keywords

decision functioncompetitive decision algorithmcompetitive force functiondegree-constrained minumum spanning tree


Mathematics Subject Classification ID

Management decision making, including multiple objectives (90B50) Programming involving graphs or networks (90C35)



Cited In (1)

  • Constant-competitive tree node assignment





This page was built for publication: Competitive decision algorithm for the degree-constrained minimum spanning tree

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3418809&oldid=16719009"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 4 February 2024, at 18:27. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki