<Record><identifier xmlns="http://purl.org/dc/elements/1.1/">URN:NBN:SI:DOC-7HNYISX2</identifier><date>2012</date><creator>Meghanathan, Natarajan</creator><relation>documents/doc/7/URN_NBN_SI_doc-7HNYISX2_001.pdf</relation><relation>documents/doc/7/URN_NBN_SI_doc-7HNYISX2_001.txt</relation><format format_type="issue">2</format><format format_type="volume">36</format><format format_type="type">article</format><format format_type="extent">str. 185-200</format><identifier identifier_type="ISSN">0350-5596</identifier><identifier identifier_type="COBISSID">26150695</identifier><identifier identifier_type="URN">URN:NBN:SI:doc-7HNYISX2</identifier><language>eng</language><publisher>Slovensko društvo Informatika</publisher><source>Informatica (Ljubljana)</source><rights>InC</rights><subject language_type_id="slv">algoritmi</subject><subject language_type_id="slv">informatika</subject><subject language_type_id="eng">information science</subject><subject language_type_id="slv">mobilna omrežja</subject><title>Graph theory algorithms for mobile as hoc networks</title></Record>