• A
  • A
  • A
  • ABC
  • ABC
  • ABC
  • А
  • А
  • А
  • А
  • А
Regular version of the site
vision user

Article

Cистема алгоритмов синтеза подмножеств минимальных графов смежности

Труды СПИИРАН. 2013. № 27. С. 200-244.
Фильченков А. А., Фроленков К. В., Сироткин А. В., Тулупьев А. Л.
Two-stage scheme for minimal join graph subsets synthesis that involves the construction of three sets (stereoseparators, their possessions and necessary edges) over given subalphabet set with subsequent construction a set of a certain kind of sinews for each stereoseparator. Systematized algorithms, implementing both stages, are systematized and their complexity is estimated.