17 search results - page 3 / 4 » Minimum sum set coloring of trees and line graphs of trees |
IWPEC
2009
Springer
14 years 10 days ago
2009
Springer
Abstract. We introduce the graph parameter boolean-width, related to the number of different unions of neighborhoods across a cut of a graph. For many graph problems this number is...
SIAMDM
2010
13 years 15 days ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...
IWPEC
2009
Springer
14 years 10 days ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
APPROX
2010
Springer
13 years 7 months ago
2010
Springer
In this paper, we consider the checkpoint problem in which given an undirected graph G, a set of sourcedestinations {(s1, t1), (s1, t1), . . . , (sk, tk)} and a set of fixed paths...
CIE
2007
Springer
13 years 12 months ago
2007
Springer
In the framework of parameterized complexity, exploring how one parameter affects the complexity of a different parameterized (or unparameterized problem) is of general interest....