- Dynamic Rescheduling as a Minimal Graph Cut Problem
Number of the records: 1  

Dynamic Rescheduling as a Minimal Graph Cut Problem

  1. Title statementDynamic Rescheduling as a Minimal Graph Cut Problem
    Main entry-name Lekavý, Marián, 1980- (Author) - FIIT Ústav informatiky a softvérového inžinierstva
    Another responsib. Návrat, Pavol, 1952- (Author) - FIIT Ústav informatiky a softvérového inžinierstva
    Translated titleDynamická zmena harmonogramu ako problém minimálneho rezu grafu
    In Software Engineering in Progress, CET-SET 2007, Poznan, Polsko, October 2007. -- Poznań : Wydawnictwo Nakom, 2007. -- ISBN 978-83-89529-44-2. -- s.141-153
    Subj. Headings harmonogram
    zmena harmonogramu
    rez grafu
    LanguageEnglish
    Document kindRZB - článok zo zborníka
    CategoryAFC - Reports at international scientific conferences
    Category (from 2022)V2 - Vedecký výstup publikačnej činnosti ako časť editovanej knihy alebo zborníka
    Year2007
    article

    article

Number of the records: 1  

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