| bibtype |
J -
Journal Article
|
| ARLID |
0324464 |
| utime |
20240903170619.4 |
| mtime |
20090622235959.9 |
| WOS |
000266401700003 |
| title
(primary) (eng) |
Two operations of merging and splitting components in a chain graph |
| specification |
| page_count |
41 s. |
| media_type |
www |
|
| serial |
| ARLID |
cav_un_epca*0297163 |
| ISSN |
0023-5954 |
| title
|
Kybernetika |
| volume_id |
45 |
| volume |
2 (2009) |
| page_num |
208-248 |
| publisher |
| name |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
|
| title
(cze) |
Dvě operace sloučení a rozdělení komponent v řetězcovém grafu |
| keyword |
chain graph |
| keyword |
essential graph |
| keyword |
factorisation equivalence |
| keyword |
feasible merging components |
| keyword |
legal merging components |
| keyword |
strong equivalence |
| author
(primary) |
| ARLID |
cav_un_auth*0101202 |
| name1 |
Studený |
| name2 |
Milan |
| institution |
UTIA-B |
| full_dept |
Department of Decision Making Theory |
| fullinstit |
Ústav teorie informace a automatizace AV ČR, v. v. i. |
|
| author
|
| ARLID |
cav_un_auth*0213979 |
| name1 |
Roverato |
| name2 |
A. |
| country |
IT |
|
| author
|
| ARLID |
cav_un_auth*0213980 |
| name1 |
Štěpánová |
| name2 |
Š. |
| country |
CZ |
|
| source |
|
| cas_special |
| project |
| project_id |
PRIN-2007AYHZWC |
| agency |
Ministero dell'Universita e della Ricerca |
| country |
IT |
|
| project |
| project_id |
GA201/04/0393 |
| agency |
GA ČR |
| ARLID |
cav_un_auth*0001808 |
|
| research |
CEZ:AV0Z10750506 |
| abstract
(eng) |
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 chain graphs. |
| abstract
(cze) |
Jsou studovány dvě operace slučování komponent v řetězcovém grafu, jež se ukazují býti elementární operacemi vedoucí k ekvivalentnímu grafu v odpovídajím smyslu. Operace umožnují snadno dokázat některé technické výsledky o faktorizační ekvivalenci řetězcových grafů. |
| reportyear |
2010 |
| RIV |
BA |
| mrcbC52 |
4 O 4o 20231122133815.1 |
| permalink |
http://hdl.handle.net/11104/0172158 |
| mrcbT16-f |
0.656 |
| mrcbT16-g |
0.055 |
| mrcbT16-h |
9.6 |
| mrcbT16-i |
0.00193 |
| mrcbT16-j |
0.34 |
| mrcbT16-k |
526 |
| mrcbT16-l |
55 |
| mrcbT16-q |
21 |
| mrcbT16-s |
0.500 |
| mrcbT16-y |
17.73 |
| mrcbT16-x |
0.57 |
| arlyear |
2009 |
| mrcbTft |
\nSoubory v repozitáři: 0324464.pdf |
| mrcbU34 |
000266401700003 WOS |
| mrcbU56 |
pdf |
| mrcbU63 |
cav_un_epca*0297163 Kybernetika 0023-5954 Roč. 45 č. 2 2009 208 248 Ústav teorie informace a automatizace AV ČR, v. v. i. |
|