Dynamic algorithm - Revision history

Altenmann: ←Redirected page to Dynamic problem (algorithms)

2007-02-04T21:37:18Z

←Redirected page to Dynamic problem (algorithms)

← Previous revision		Revision as of 21:37, 4 February 2007
Line 1:		Line 1:
			#redirect [[Dynamic problem (algorithms)]]
	Most of [[algorithms]] are '''static''' in the sense that the recorded information will destruct after solving the problem, but sometimes people want to maintain some properties and need algorithms working as monitors.

	The goal of '''dynamic algorithms''' is to efficiently update the solution of problem after [[dynamic change]]s. There are two kinds of dynamic algorithms, one is '''partially dynamic''' if the defined operations are irreversible, and the second kind is '''fully dynamic''' if the defined operations are reversible.

	For example, a partially dynamic graph algorithm for connectivity is allowed only insertion of edge or deletion of edge, hence its defined operation is irreversible.

	==References==

	* D. Eppstein, Z. Galil, and G. F. Italiano. [http://citeseer.ist.psu.edu/eppstein99dynamic.html Dynamic graph algorithms]. In CRC Handbook of Algorithms and Theory of Computation, Chapter 22. CRC Press, 1997. 95

	[[category: algorithms]]

Goldenrowley: category. add links

2007-01-03T02:33:26Z

category. add links

← Previous revision		Revision as of 02:33, 3 January 2007
Line 1:		Line 1:
		⚫	Most of [[algorithms]] are '''static''' in the sense that the recorded information will destruct after solving the problem, but sometimes people want to maintain some properties and need algorithms working as monitors.
	{{uncat\|November 2006}}

		⚫	The goal of '''dynamic algorithms''' is to efficiently update the solution of problem after [[dynamic change]]s. There are two kinds of dynamic algorithms, one is '''partially dynamic''' if the defined operations are irreversible, and the second kind is '''fully dynamic''' if the defined operations are reversible.
⚫	Most of algorithms are '''static''' in the sense that the recorded information will destruct after solving the problem, but sometimes people want to maintain some properties and need algorithms working as monitors.

⚫	The goal of '''dynamic algorithms''' is to efficiently update the solution of problem after dynamic ~~changes~~. There are two kinds of dynamic algorithms, one is '''partially dynamic''' if the defined operations are irreversible, and the second kind is '''fully dynamic''' if the defined operations are reversible.

	For example, a partially dynamic graph algorithm for connectivity is allowed only insertion of edge or deletion of edge, hence its defined operation is irreversible.		For example, a partially dynamic graph algorithm for connectivity is allowed only insertion of edge or deletion of edge, hence its defined operation is irreversible.
Line 10:		Line 8:

	* D. Eppstein, Z. Galil, and G. F. Italiano. [http://citeseer.ist.psu.edu/eppstein99dynamic.html Dynamic graph algorithms]. In CRC Handbook of Algorithms and Theory of Computation, Chapter 22. CRC Press, 1997. 95		* D. Eppstein, Z. Galil, and G. F. Italiano. [http://citeseer.ist.psu.edu/eppstein99dynamic.html Dynamic graph algorithms]. In CRC Handbook of Algorithms and Theory of Computation, Chapter 22. CRC Press, 1997. 95

			[[category: algorithms]]

Pascal.Tesson: moved Dynamic Algorithms to Dynamic algorithm: naming conventions

2007-01-02T16:23:04Z

moved Dynamic Algorithms to Dynamic algorithm: naming conventions

← Previous revision	Revision as of 16:23, 2 January 2007
(No difference)

Elonka: tagging as uncategorized using AWB

2006-11-27T13:29:47Z

tagging as uncategorized using AWB

← Previous revision		Revision as of 13:29, 27 November 2006
Line 1:		Line 1:
			{{uncat\|November 2006}}

	Most of algorithms are '''static''' in the sense that the recorded information will destruct after solving the problem, but sometimes people want to maintain some properties and need algorithms working as monitors.		Most of algorithms are '''static''' in the sense that the recorded information will destruct after solving the problem, but sometimes people want to maintain some properties and need algorithms working as monitors.

AbnerCYH at 07:03, 25 November 2006

2006-11-25T07:03:05Z

← Previous revision		Revision as of 07:03, 25 November 2006
Line 1:		Line 1:
	Most of algorithms are static in the sense that the recorded information will destruct after solving the problem, but sometimes people want to maintain some properties and need algorithms working as monitors.		Most of algorithms are '''static''' in the sense that the recorded information will destruct after solving the problem, but sometimes people want to maintain some properties and need algorithms working as monitors.

	The goal of dynamic algorithms is to efficiently update the solution of problem after dynamic changes. There are two kinds of dynamic algorithms, one is partially dynamic if the defined operations are irreversible, and the second kind is fully dynamic if the defined operations are reversible.		The goal of '''dynamic algorithms''' is to efficiently update the solution of problem after dynamic changes. There are two kinds of dynamic algorithms, one is '''partially dynamic''' if the defined operations are irreversible, and the second kind is '''fully dynamic''' if the defined operations are reversible.

	For example, a partially dynamic graph algorithm for connectivity is allowed only insertion of edge or deletion of edge, hence its defined operation is irreversible.		For example, a partially dynamic graph algorithm for connectivity is allowed only insertion of edge or deletion of edge, hence its defined operation is irreversible.

AbnerCYH at 19:57, 24 November 2006

2006-11-24T19:57:16Z

← Previous revision		Revision as of 19:57, 24 November 2006
Line 3:		Line 3:
	The goal of dynamic algorithms is to efficiently update the solution of problem after dynamic changes. There are two kinds of dynamic algorithms, one is partially dynamic if the defined operations are irreversible, and the second kind is fully dynamic if the defined operations are reversible.		The goal of dynamic algorithms is to efficiently update the solution of problem after dynamic changes. There are two kinds of dynamic algorithms, one is partially dynamic if the defined operations are irreversible, and the second kind is fully dynamic if the defined operations are reversible.

	For example, a partially dynamic graph algorithm for connectivity is allowed only insertion of edge or deletion of edge.		For example, a partially dynamic graph algorithm for connectivity is allowed only insertion of edge or deletion of edge, hence its defined operation is irreversible.

	==References==		==References==

AbnerCYH at 19:56, 24 November 2006

2006-11-24T19:56:11Z

New page

Most of algorithms are static in the sense that the recorded information will destruct after solving the problem, but sometimes people want to maintain some properties and need algorithms working as monitors.

The goal of dynamic algorithms is to efficiently update the solution of problem after dynamic changes. There are two kinds of dynamic algorithms, one is partially dynamic if the defined operations are irreversible, and the second kind is fully dynamic if the defined operations are reversible.

For example, a partially dynamic graph algorithm for connectivity is allowed only insertion of edge or deletion of edge.

==References==

* D. Eppstein, Z. Galil, and G. F. Italiano. [http://citeseer.ist.psu.edu/eppstein99dynamic.html Dynamic graph algorithms]. In CRC Handbook of Algorithms and Theory of Computation, Chapter 22. CRC Press, 1997. 95