Author of the publication

Interval Routing in Reliability Networks.

, and . SIROCCO, volume 17 of Proceedings in Informatics, page 147-162. Carleton Scientific, (2003)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Near-Optimal Dominating Sets via Random Sampling.. AAIM, volume 9778 of Lecture Notes in Computer Science, page 162-172. Springer, (2016)Probabilistic Analysis of Graphlets in Sparse E-R Random Graphs.. ITAT, volume 2203 of CEUR Workshop Proceedings, page 171-175. CEUR-WS.org, (2018)An Improved Interval Routing Scheme for Almost All Networks Based on Dominating Cliques., and . ISAAC, volume 3827 of Lecture Notes in Computer Science, page 524-532. Springer, (2005)A Detailed Study of the Dominating Cliques Phase Transition in Random Graphs., , and . TAMC, volume 7287 of Lecture Notes in Computer Science, page 594-603. Springer, (2012)Estimation of the domination number in sparse random graphs and applications., , and . ECBS, page 7:1-7:9. ACM, (2017)The most common issues in development of causal-loop diagrams and stock-and-flow diagrams., , , and . Int. J. Intell. Eng. Informatics, 8 (5/6): 419-438 (2020)On using of random access machine simulators in teaching of theoretical computer science., , and . CompSysTech, page 84. ACM, (2009)On Communication Protocols in Unreliable Mesh Networks and their Relation to Phase Transitions., and . PDCS, page 235-240. ISCA, (2004)Interval Routing in Reliability Networks., and . SIROCCO, volume 17 of Proceedings in Informatics, page 147-162. Carleton Scientific, (2003)Comparison of algorithms for near-optimal dominating sets computation in real-world networks., , and . CompSysTech, page 199-206. ACM, (2015)