User contributions for Dkratschmann

This user is currently blocked. The latest active block log entry is provided below for reference:

13:49, 20 June 2015 Luedecke talk contribs blocked Dkratschmann talk contribs with an expiration time of indefinite (account creation disabled) (not necessary anymore)

19:0319:03, 14 October 2014 diff hist +3,339 N Array list: insert at position Created page with "'''Algorithmic problem:''' Linear sequence: insert at position '''Prerequisites:''' Parameters: A key <math>\Kappa \in K, a position l \in \{0, \ldots, number()\}</math>...."
18:3618:36, 14 October 2014 diff hist +1,494 N Array list: find Created page with "'''Algorithmic problem:''' Linear sequence: find '''Prerequisites:''' None. '''Type of algorithm:''' loop '''Auxiliary data:''' A pointer <math>p</math> of type "pointe..."

20:0120:01, 6 October 2014 diff hist +1 Maximum spanning forest No edit summary
20:0120:01, 6 October 2014 diff hist +458 N Maximum spanning forest Created page with "== Input == # An undirected graph <math>G = (V,E)</math>, not necessarily connected. # An edge length <math>l(e) \in \mathbb{R}_0^+</math> for each edge <math>e \in E</mat..."
19:5019:50, 6 October 2014 diff hist +1,900 N Shortest paths by repeated squaring Created page with "'''Algorithmic problem:''' All pairs shortest paths '''Prerequisites:''' None '''Type of algorithm:''' loop # A distance-valued <math>(n \times n)</math>-matrix <mat..." current

14:4614:46, 4 October 2014 diff hist −46 Floyd-Warshall No edit summary
14:3714:37, 4 October 2014 diff hist +6 Floyd-Warshall No edit summary
14:3714:37, 4 October 2014 diff hist +1 Floyd-Warshall No edit summary
14:3614:36, 4 October 2014 diff hist +520 Floyd-Warshall No edit summary
14:3314:33, 4 October 2014 diff hist +2,517 N Floyd-Warshall Created page with "'''Algorithmic problem:''' All pairs shortest paths '''Prerequisites:''' None '''Type of algorithm:''' loop '''Auxilliary data:''' # A constant representing the number..."
14:0214:02, 4 October 2014 diff hist +4 All pairs shortest paths No edit summary
13:5913:59, 4 October 2014 diff hist 0 All pairs shortest paths No edit summary
13:4813:48, 4 October 2014 diff hist +505 N All pairs shortest paths Created page with "== Input == * A directed Graph <math>G = (V,A)</math> * An arc length <math>l(a) \in \mathbb{R}</math> for each arc <math>a \in A</math> == Ouptut == For each pair <math>(v..."

Navigation menu