<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="I">   <ARLID>0031265</ARLID> <utime>20240103182405.6</utime><mtime>20060901235959.9</mtime>         <title language="eng" primary="1">Two Operations of Merging Components in a Chain Graph</title>  <publisher> <place>Praha</place> <name>ÚTIA AV ČR</name> <pub_time>2005</pub_time> </publisher> <specification> <page_count>42 s.</page_count> </specification> <edition> <name>Interní publikace - DAR - ÚTIA</name> <volume_id>2005/38</volume_id> </edition>    <keyword>chain graph</keyword>   <keyword>factorisation equivalence</keyword>    <author primary="1"> <ARLID>cav_un_auth*0101202</ARLID> <name1>Studený</name1> <name2>Milan</name2> <institution>UTIA-B</institution> <full_dept>Department of Decision Making Theory</full_dept>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0213979</ARLID> <name1>Roverato</name1> <name2>A.</name2> <country>IT</country>  </author> <author primary="0"> <ARLID>cav_un_auth*0213980</ARLID> <name1>Štěpánová</name1> <name2>Š.</name2> <country>CZ</country>  </author>     <COSATI>09J</COSATI>    <cas_special> <project> <project_id>1M0572</project_id> <agency>GA MŠk</agency> <country>CZ</country> <ARLID>cav_un_auth*0001814</ARLID> </project> <research> <research_id>CEZ:AV0Z10750506</research_id> </research>   <reportyear>2007</reportyear>  <RIV>BD</RIV>      <permalink>http://hdl.handle.net/11104/0132014</permalink>       <arlyear>2005</arlyear>       <unknown tag="mrcbU10"> 2005 </unknown> <unknown tag="mrcbU10"> Praha ÚTIA AV ČR </unknown> </cas_special> </bibitem>