396 search results - page 24 / 80 » Exact Algorithms for Graph Homomorphisms |
105
click to vote
WADS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
133
click to vote
STACS
2007
Springer
15 years 8 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
143
click to vote
ASP
2005
Springer
15 years 7 months ago
2005
Springer
A new exact algorithm for computing answer sets of logic programs is presented and analyzed. The algorithm takes a logic program in Kernel normal form as an input and computes its ...
126
click to vote
AAIM
2007
Springer
15 years 8 months ago
2007
Springer
An acyclic edge colouring of a graph is a proper edge colouring having no 2-coloured cycle, that is, a colouring in which the union of any two colour classes forms a linear forest...
115
click to vote
SODA
2008
ACM
15 years 3 months ago
2008
ACM
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...