DAM
2008
13 years 11 months ago
2008
DAM
2008
13 years 11 months ago
2008
DAM
2008
13 years 11 months ago
2008
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NPcomplete to ...
DAM
2008
13 years 11 months ago
2008
We interpret the reciprocation process in K[[x]] as a fixed point problem related to contractive functions for certain adequate ultrametric spaces. This allows us to give a dynamic...
DAM
2008
13 years 11 months ago
2008
Given graphs G, G1, . . . , Gk, where k 2, the notation G (G1, G2, . . . , Gk) denotes that every factorization F1 F2
DAM
2008
13 years 11 months ago
2008
We consider vertex coloring of an acyclic digraph G in such a way that two vertices which have a common ancestor in G receive distinct colors. Such colorings arise in a natural wa...
DAM
2008
13 years 11 months ago
2008
We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial time algorithm for ...
DAM
2008
13 years 11 months ago
2008
In this short paper we examine the problem of scheduling malleable tasks on parallel processors. One of the main aims of the paper is to present a simple complexity interpretation...
DAM
2008
13 years 11 months ago
2008
A transitive orientation of an undirected graph is an assignment of directions to its edges so that these directed edges represent a transitive relation between the vertices of th...
DAM
2008
13 years 11 months ago
2008
Circular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to their definition by means of a more general coloring concept, on the other hand as an i...