Seminár z teoretickej informatiky - Ján Mazák (15.4.2016)

v piatok 15.4.2016 o 11:00 hod. v miestnosti M/213

---

Prednášajúci: Ján Mazák

Názov prednášky: An efficient algorithm for testing goal-minimality of graphs

Termín: 15.4.2016, 11:00 hod., M/213

Abstrakt:
An undirected graph G with diameter k is said to be goal-minimally k-diametric if for every edge uv of G the distance dG−uv(x,y)>k if and only if {x,y}={u,v}. We describe an efficient algorithm for determining whether a given graph is goal-minimally k-diametric or not.

web: http://kedrigern.dcs.fmph.uniba.sk/STI2 
rss: http://kedrigern.dcs.fmph.uniba.sk/STI2/rss.php 

---