Search results

Records found: 2  
Your query: Author Sysno = "^stu_us_auth stus49551^"
  1. Comparison of Algorithms for Near-Optimal Dominating Sets Computation in Real-World Networks / aut. Martin Nehéz, Dušan Bernát, Martin Klaučo
    Nehéz Martin ; 047270  Bernát Dušan ; 070400 Klaučo Martin ; 047220
    CompSysTech'15. Proceedings of the 16th International Conference on Computer Systems and Technologies CompSysTech '15, Dublin, Ireland, June 25-26, 2015 / . S. 199-206
    minimum dominating set complex networks PPI Networks random graph integer linear programming hill-climbing algorithms
    článok zo zborníka
    AFC - Reports at international scientific conferences
    V2 - Vedecký výstup publikačnej činnosti ako časť editovanej knihy alebo zborníka
    article

    article

  2. Partitioning Networks into Cliques: A Randomized Heuristic Approach
    Chalupa David ; I300  Pospíchal Jiří (Thesis advisor) ; I300
    Bratislava : STU v Bratislave FIIT, 2014
    FIIT ; 25.06.2014 ; 213
    complex networks komplexné siete pokrytie kompletnými podgrafmi
    http://is.stuba.sk/zp/portal_zp.pl?podrobnosti=94140
    dizertačná práca
    DAI - Qualificational works (thesis, habilitation, atestation...)
    book

    book



  This site uses cookies to make them easier to browse. Learn more about how we use cookies.