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 4198042

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

zbMATH Open0726.05056MaRDI QIDQ3348012FDOQ3348012


Authors: V. I. Miroshnichenko Edit this on Wikidata


Publication date: 1989


Full work available at URL: https://eudml.org/doc/51513

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



Recommendations

  • scientific article; zbMATH DE number 3891405
  • scientific article; zbMATH DE number 3846542
  • scientific article; zbMATH DE number 1094324
  • scientific article; zbMATH DE number 4010557
  • A distance approximating trees


zbMATH Keywords

treealgorithmminimal total length of edges


Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35)



Cited In (4)

  • Title not available (Why is that?)
  • Sets admitting connection by graphs of finite length
  • Constructing a minimum height elimination tree of a tree in linear time
  • Title not available (Why is that?)





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

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