<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="C">   <ARLID>0349660</ARLID> <utime>20240103194128.5</utime><mtime>20101118235959.9</mtime>         <title language="eng" primary="1">Honour Thy Neighbour — Clique Maintenance in Dynamic Graphs</title>  <specification> <page_count>8 s.</page_count> <media_type>www</media_type> </specification>   <serial><ARLID>cav_un_epca*0349659</ARLID><ISBN>978-952-60-3314-3</ISBN><title>Proceedings of the Fifth European Workshop on Probabilistic Graphical Models (PGM-2010)</title><part_num/><part_title/><page_num>201-208</page_num><publisher><place>Helsinki</place><name>HIIT Publications</name><year>2010</year></publisher></serial>    <keyword>Graph triangulation</keyword>   <keyword>Probabilistic Graphical Models</keyword>    <author primary="1"> <ARLID>cav_un_auth*0265748</ARLID> <name1>Ottosen</name1> <name2>T.</name2> <country>DK</country>  </author> <author primary="0"> <ARLID>cav_un_auth*0101228</ARLID> <name1>Vomlel</name1> <name2>Jiří</name2> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept>Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department>MTR</department> <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>   <source> <url>http://library.utia.cas.cz/separaty/2010/MTR/vomlel-honour thy neighbour clique maintenance in dynamic graphs.pdf</url> </source>        <cas_special> <project> <project_id>2C06019</project_id> <agency>GA MŠk</agency> <country>CZ</country> <ARLID>cav_un_auth*0216518</ARLID> </project> <project> <project_id>1M0572</project_id> <agency>GA MŠk</agency> <ARLID>cav_un_auth*0001814</ARLID> </project> <project> <project_id>GA201/09/1891</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0253175</ARLID> </project> <project> <project_id>ICC/08/E010 Eurocores LogICCC</project_id> <agency>GA ČR</agency> <country>CZ</country> <ARLID>cav_un_auth*0255499</ARLID> </project> <research> <research_id>CEZ:AV0Z10750506</research_id> </research>  <abstract language="eng" primary="1">We derive a new simple method for finding cliques of a dynamicaly changing graph. The method is based on the Bron-Kerbosch algorithm that compares favourably to Stix’ approach.</abstract>  <action target="WRD"> <ARLID>cav_un_auth*0265733</ARLID> <name>European Workshop on Probabilistic Graphical Models</name> <place>Helsinki</place> <dates>13.09.2010-15.09.2010</dates>  <country>FI</country> </action>    <reportyear>2011</reportyear>  <RIV>BD</RIV>      <permalink>http://hdl.handle.net/11104/0189838</permalink>        <arlyear>2010</arlyear>       <unknown tag="mrcbU63"> cav_un_epca*0349659 Proceedings of the Fifth European Workshop on Probabilistic Graphical Models (PGM-2010) 978-952-60-3314-3 201 208 Proceedings of the Fifth European Workshop on Probabilistic Graphical Models (PGM-2010) Helsinki HIIT Publications 2010 </unknown> </cas_special> </bibitem>