3911. |
3912. |
3913. |
3914. |
3915. |
3916. |
3917. |
3918. |
3919. |
3920. Graphʼs theory approach for searching the shortest routing path in RIP protocolSaša Klampfer, Jože Mohorko, Žarko Čučej, Amor Chowdhury, 2012 Ključne besede: circular graphs, shortest path, graph diameter, walk through, CIGRP, connectivity matrix, network topology, symmetry, fully connected graph, Objavljeno v DKUM: 10.07.2015; Ogledov: 2554; Prenosov: 98
Povezava na celotno besedilo |