"0302-9743" . "11320" . "So far, edge-finding is the only one major filtering algorithm for unary resource constraint with time complexity O(n log n). This paper proposes O(n log n) versions of another two filtering algorithms: not-first/not-last and propagation of detectable precedences. These two algorithms can be used together with the edge-finding to further improve the filtering. This paper also propose new O (n log n) implementation of fail detection (overload checking)."@en . "3011" . . "O (n log n) filtering algorithms for unary resource constraint" . . . "filtering; algorithms; unary; resource; constraint"@en . "RIV/00216208:11320/04:00005578!RIV08-MSM-11320___" . "O (n log n) filtrovac\u00ED algorithmy pro un\u00E1rn\u00ED omezen\u00ED zdroj\u016F"@cs . "O (n log n) filtering algorithms for unary resource constraint" . . "O (n log n) filtering algorithms for unary resource constraint"@en . "13"^^ . . "P(GA201/04/1102), Z(MSM 113200005)" . . . "Vil\u00EDm, Petr" . . "O (n log n) filtering algorithms for unary resource constraint"@en . "So far, edge-finding is the only one major filtering algorithm for unary resource constraint with time complexity O(n log n). This paper proposes O(n log n) versions of another two filtering algorithms: not-first/not-last and propagation of detectable precedences. These two algorithms can be used together with the edge-finding to further improve the filtering. This paper also propose new O (n log n) implementation of fail detection (overload checking)." . . "[39ABB3BA51CE]" . "335;347" . . . "Lecture Notes In Computer Science" . "577046" . . . "1"^^ . . . . "1" . "O (n log n) filtrovac\u00ED algorithmy pro un\u00E1rn\u00ED omezen\u00ED zdroj\u016F"@cs . . "RIV/00216208:11320/04:00005578" . "DE - Spolkov\u00E1 republika N\u011Bmecko" . "1"^^ . . . "\u010Cl\u00E1nek popisuje O(n log n) verze dvou filtrovac\u00EDch algoritm\u016F pro un\u00E1rn\u00ED omezen\u00ED zdroj\u016F: ne-prvn\u00ED/ne-posledn\u00ED a propagace detekovateln\u00FDch precedenc\u00ED."@cs .