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

scientific article; zbMATH DE number 1285634

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

zbMATH Open0913.05058MaRDI QIDQ4242391FDOQ4242391


Authors: A. I. Serdyukov Edit this on Wikidata


Publication date: 10 May 1999



Title of this publication is not available (Why is that?)



Recommendations

  • On finding a maximum spanning tree of bounded radius
  • scientific article; zbMATH DE number 4097419
  • scientific article; zbMATH DE number 1594512
  • scientific article; zbMATH DE number 731844
  • On the approximability of some maximum spanning tree problems


zbMATH Keywords

algorithmNP-hardspanning treesearching


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Analysis of algorithms and problem complexity (68Q25) Search theory (90B40) Extremal problems in graph theory (05C35)



Cited In (3)

  • On the Red/Blue Spanning Tree Problem
  • Title not available (Why is that?)
  • On finding a maximum spanning tree of bounded radius





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 Q4242391)

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