Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.

MLA

Petr Kolman, and Christian Scheideler. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” Algorithmica, vol. 39, no. 3, Apr. 2004, pp. 209–33. EBSCOhost, widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edb&AN=12995623&authtype=sso&custid=ns315887.

APA

Petr Kolman, & Christian Scheideler. (2004). Simple On-Line Algorithms for the Maximum Disjoint Paths Problem. Algorithmica, 39(3), 209–233.

Chicago

Petr Kolman, and Christian Scheideler. 2004. “Simple On-Line Algorithms for the Maximum Disjoint Paths Problem.” Algorithmica 39 (3): 209–33. http://widgets.ebscohost.com/prod/customlink/proxify/proxify.php?count=1&encode=0&proxy=&find_1=&replace_1=&target=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&scope=site&db=edb&AN=12995623&authtype=sso&custid=ns315887.