TAMC
2010
Springer
13 years 2 months ago
2010
Springer
TAMC
2010
Springer
13 years 2 months ago
2010
Springer
TAMC
2010
Springer
13 years 2 months ago
2010
Springer
Clique-width is an important graph parameter whose computation is NP-hard. In fact we do not know of any other algorithm than brute force for the exact computation of clique-width...
TAMC
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
TAMC
2010
Springer
13 years 8 months ago
2010
Springer
TAMC
2010
Springer
13 years 8 months ago
2010
Springer
In this paper, we investigate partial words, or finite sequences that may have some undefined positions called holes, of maximum subword complexity. The subword complexity functi...
TAMC
2010
Springer
13 years 9 months ago
2010
Springer
In this paper, we establish the definition of community fundamentally different from what was commonly accepted in previous studies, where communities were typically assumed to ...
TAMC
2010
Springer
13 years 9 months ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
TAMC
2010
Springer
13 years 9 months ago
2010
Springer
An instance of the max k−cut game is an edge weighted graph. Every
TAMC
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. In property testing, the goal is to distinguish between objects that satisfy some desirable property and objects that are far from satisfying it, after examining only a s...