Two operations of merging and splitting components in a chain graph
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F09%3A00324464" target="_blank" >RIV/67985556:_____/09:00324464 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Two operations of merging and splitting components in a chain graph
Original language description
Two operations of merging components in a chain graph, which appear to be elementary operations yielding an equivalent graph in the respective sense, are studied. They allow one to prove easily some technical results on factorisation equivalence of chaingraphs.
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F04%2F0393" target="_blank" >GA201/04/0393: Conditional independence structures: information-theoretical approach III.</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Kybernetika
ISSN
0023-5954
e-ISSN
—
Volume of the periodical
45
Issue of the periodical within the volume
2
Country of publishing house
CZ - CZECH REPUBLIC
Number of pages
41
Pages from-to
—
UT code for WoS article
000266401700003
EID of the result in the Scopus database
—