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

scientific article; zbMATH DE number 434699

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

zbMATH Open0837.05045MaRDI QIDQ3139538FDOQ3139538


Authors: Ewa Kubicka, Grzegorz Kubicki, F. R. McMorris Edit this on Wikidata


Publication date: 2 January 1994



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



Recommendations

  • scientific article; zbMATH DE number 637531
  • The agreement metric for labeled binary trees
  • scientific article; zbMATH DE number 736964
  • scientific article; zbMATH DE number 1974592
  • An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees


zbMATH Keywords

binary treeendverticesagreement subtree


Mathematics Subject Classification ID

Trees (05C05)



Cited In (11)

  • Kaikoura tree theorems: Computing the maximum agreement subtree
  • Finding smallest supertrees
  • On the Maximum Agreement Subtree Conjecture for Balanced Trees
  • An algorithm to find agreement subtrees
  • Title not available (Why is that?)
  • An improved bound on the maximum agreement subtree problem
  • The agreement metric for labeled binary trees
  • On the extremal maximum agreement subtree problem
  • Expected conflicts in pairs of rooted binary trees
  • The maximum agreement subtree problem
  • Maximum agreement subtrees and Hölder homeomorphisms between Brownian trees





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

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