Optimization of Matchings in Trees

Michal Mankowski*, Mikhail Moshkov

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

In this chapter, we design a syntactical circuit for the problem of optimization of matching in trees, describe cost functions, evaluate the number of operations and the time required by the algorithms for optimization and counting, discuss an example, show experimental results, andnn compare results obtained in this chapter and in Part III.

Original languageEnglish (US)
Title of host publicationStudies in Systems, Decision and Control
PublisherSpringer Science and Business Media Deutschland GmbH
Pages189-200
Number of pages12
DOIs
StatePublished - 2021

Publication series

NameStudies in Systems, Decision and Control
Volume331
ISSN (Print)2198-4182
ISSN (Electronic)2198-4190

Bibliographical note

Publisher Copyright:
© The Author(s), under exclusive license to Springer Nature Switzerland AG 2021.

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Control and Systems Engineering
  • Automotive Engineering
  • Social Sciences (miscellaneous)
  • Economics, Econometrics and Finance (miscellaneous)
  • Control and Optimization
  • Decision Sciences (miscellaneous)

Cite this