OPODIS
2008
13 years 8 months ago
2008
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
FAW
2009
Springer
14 years 1 months ago
2009
Springer
We give a linear-time algorithm for computing the edge search number of cographs, thereby proving that this problem can be solved in polynomial time on this graph class. With our ...