<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
    <responseDate>2026-05-16T16:34:45.646Z</responseDate>
    <request verb="GetRecord" identifier="ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai:2:3464" metadataPrefix="dim">http://ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai</request>
    <GetRecord>
        <record>
            <header>
                <identifier>ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai:2:3464</identifier>
                <datestamp>2015-11-10T19:57:54Z</datestamp>
                <setSpec>2</setSpec>
            </header>
            <metadata>
                <dim:dim>
                    <dim:field mdschema="dc" element="title" lang="en">Network topology availability analysis</dim:field>
                    <dim:field mdschema="dc" element="date" qualifier="issued">2011</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="uri">http://ezaposleni.singidunum.ac.rs/rest/sciNaucniRezultati/oai/record/2/3464</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="uri">http://journal.telfor.rs/Published/Vol3No1/Vol3No1_A5.pdf</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="etfid:573" confidence="-1">M. Čabarkapa</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="id:11591" confidence="-1">Đ. Mijatović</dim:field>
                    <dim:field mdschema="dc" element="contributor" qualifier="author" authority="id:11592" confidence="-1">N. Krajnović</dim:field>
                    <dim:field mdschema="dc" element="description" qualifier="abstract"> In this paper the availabilities of some network topologies are analyzed and calculated. Software based on exact All-terminal Graph reduction Algorithm is developed and applied. Results, conclusions and solutions are presented, demonstrated and discussed. </dim:field>
                    <dim:field mdschema="dc" element="type">article</dim:field>
                    <dim:field mdschema="dc" element="citation" qualifier="volume">3</dim:field>
                    <dim:field mdschema="dc" element="citation" qualifier="issue">1</dim:field>
                    <dim:field mdschema="dc" element="citation" qualifier="spage">23</dim:field>
                    <dim:field mdschema="dc" element="citation" qualifier="epage">27</dim:field>
                    <dim:field mdschema="dc" element="identifier" qualifier="issn">1821-3251</dim:field>
                    <dim:field mdschema="dc" element="source">Telfor Journal</dim:field>
                </dim:dim>
            </metadata>
        </record>
    </GetRecord>
</OAI-PMH>
