Back to Results
First PageMeta Content
Applied mathematics / Network flow / Operations research / Local consistency / Flow network / Bellman–Ford algorithm / Decomposition method / Constraint programming / Theoretical computer science / Mathematics


Classical Dynamic Controllability Revisited A Tighter Bound on the Classical Algorithm Mikael Nilsson, Jonas Kvarnstr¨om and Patrick Doherty Department of Computer and Information Science, Link¨oping University, SE-581
Add to Reading List

Document Date: 2014-04-25 10:49:37

Open Document

File Size: 369,55 KB

Share Result on Facebook

Company

ABC / Ford / Simple Temporal Networks / IDC / /

/

Facility

Store Start Cooking / Link¨oping University / /

IndustryTerm

incremental algorithm / classical algorithm / verification algorithm / verification algorithms / food / /

Organization

Link¨oping University / Patrick Doherty Department of Computer and Information Science / /

Person

Patrick Doherty / Jonas Kvarnstr¨om / /

Position

General / /

Product

D1 / /

ProgrammingLanguage

DC / /

ProvinceOrState

Alberta / /

Technology

Three algorithms / incremental DC verification algorithms / classical algorithm / contingent Algorithm / FastIDC algorithm / verification algorithm / DC algorithm / Morris algorithm / incremental FastIDC algorithm / incremental algorithm / two algorithms / modified FastIDC algorithm / /

SocialTag