Autore: Dieter Kratsch

…

The 33rd International Conference "Workshop on Graph-Theoretic Concepts in Computer Science" (WG 2007) took place in the Conference Center in old castlein Dornburgnear Jena, Germany, …

For a long time computer scientists have distinguished between fast and slow algo rithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of …