36781 search results - page 40 / 7357 » Parameterizing by the Number of Numbers |
GD
2006
Springer
14 years 1 months ago
2006
Springer
Tree decompositions of graphs are of fundamental importance in structural and algorithmic graph theory. Planar decompositions generalise tree decompositions by allowing an arbitrar...
OPODIS
2008
13 years 11 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 ...
JUCS
2006
13 years 10 months ago
2006
Abstract: Pseudorandom number generators are widely used in the area of simulation. Defective generators are still widely used in standard library programs, although better pseudor...
SIAMDM
2008
13 years 10 months ago
2008
The first-fit chromatic number of a graph is the number of colors needed in the worst case of a greedy coloring. It is also called the Grundy number, which is defined to be the max...
STOC
2005
ACM
14 years 10 months ago
2005
ACM
In this paper we describe the first singly exponential algorithm for computing the first Betti number of a given semi-algebraic set. We also describe algorithms for obtaining semi...