An Exact Algorithm for the Generalized List TT-Coloring Problem

The generalized list $T$-coloring is a common generalization of many graph coloring models, including classical coloring, $L(p,q)$-labeling, channel assignment and $T$-coloring. Every vertex from the input graph has a list of permitted labels. Moreover, every edge has a set of forbidden differences. We ask for such a labeling of vertices of the input graph with natural numbers, in which every vertex gets a label from its list of permitted labels and the difference of labels of the endpoints of each edge does not belong to the set of forbidden differences of this edge. In this paper we present an exact algorithm solving this problem, running in time $\mathcal{O}^*((\tau+2)^n)$, where $\tau$ is the maximum forbidden difference over all edges of the input graph and $n$ is the number of its vertices. Moreover, we show how to improve this bound if the input graph has some special structure, e.g. a bounded maximum degree, no big induced stars or a perfect matching

A Greedy Algorithm for the Social Golfer and the Oberwolfach Problem

Inspired by the increasing popularity of Swiss-system tournaments in sports, we study the problem of predetermining the number of rounds that can be guaranteed in a Swiss-system tournament. Matches of these tournaments are usually determined in a myopic round-based way dependent on the results of previous rounds. Together with the hard constraint that no two players meet more than once during the tournament, at some point it might become infeasible to schedule a next round. For tournaments with $n$ players and match sizes of $k\geq2$ players, we prove that we can always guarantee $\lfloor \frac{n}{k(k-1)} \rfloor$ rounds. We show that this bound is tight. This provides a simple polynomial time constant factor approximation algorithm for the social golfer problem. We extend the results to the Oberwolfach problem. We show that a simple greedy approach guarantees at least $\lfloor \frac{n+4}{6} \rfloor$ rounds for the Oberwolfach problem. This yields a polynomial time $\frac{1}{3+\epsilon}$-approximation algorithm for any fixed $\epsilon>0$ for the Oberwolfach problem. Assuming that El-Zahar's conjecture is true, we improve the bound on the number of rounds to be essentially tight.Comment: 24 pages, 4 figure

Generalized Set and Graph Packing Problems

Many complex systems that exist in nature and society can be expressed in terms of networks (e.g., social networks, communication networks, biological networks, Web graph, among others). Usually a node represents an entity while an edge represents an interaction between two entities. A community arises in a network when two or more entities have common interests, e.g., related proteins, industrial sectors, groups of people, documents of a collection. There exist applications that model a community as a fixed graph H [98, 10, 119, 2, 142, 136]. Additionally, it is not expected that an entity of the network belongs to only one community; that is, communities tend to share their members. The community discovering or community detection problem consists on finding all communities in a given network. This problem has been extensively studied from a practical perspective [61, 137, 122, 116]. However, we believe that this problem also brings many interesting theoretical questions. Thus in this thesis, we will address this problem using a more rigorous approach. To that end, we first introduce graph problems that we consider capture well the community discovering problem. These graph problems generalize the classical H-Packing problem [88] in two different ways. In the H-Packing with t-Overlap problem, the goal is to find in a given graph G (the network) at least k subgraphs (the communities) isomorphic to a member of a family of graphs H (the community models) such that each pair of subgraphs overlaps in at most t vertices (the shared members). On the other hand, in the H-Packing with t-Membership problem instead of limiting the pairwise overlap, each vertex of G is contained in at most t subgraphs of the solution. For both problems each member of H has at most r vertices and m edges. An instance of the H-Packing with t-Overlap and t-Membership problems corresponds to an instance of the H-Packing problem for t = 0 and t = 1, respectively. We also restrict the overlap between the edges of the subgraphs in the solution instead of the vertices (called H-Packing with t-Edge Overlap and t-Edge Membership problems). Given the closeness of the r-Set Packing problem [87] to the H-Packing problem, we also consider overlap in the problem of packing disjoint sets of size at most r. As usual for set packing problems, given a collection S drawn from a universe U, we seek a sub-collection S'⊆S consisting of at least k sets subject to certain disjointness restrictions. In the r-Set Packing with t-Membership, each element of U belongs to at most t sets of S' while in the r-Set Packing with t-Overlap each pair of sets in S' overlaps in at most t elements. For both problems, each set of S has at most r elements. We refer to all the problems introduced in this thesis simply as packing problems with overlap. Also, we group as the family of t-Overlap problems: H-Packing with t-Overlap, H-Packing with t-Edge Overlap, and r-Set Packing with t-Overlap. While we call the family of t-Membership problems: H-Packing with t-Membership, H-Packing with t-Edge Membership, and r-Set Packing with t-Membership. The classical H-Packing and r-Set Packing problems are NP-complete [87, 88]. We will show in this thesis that allowing overlap in a packing does not make the problems "easier". More precisely, we show that the H-Packing with t-Membership and the r-Set Packing with t-Membership are NP-complete when H = {H'} and H' is an arbitrary connected graph with at least three vertices and r≥3, respectively. Parameterized complexity, introduced by Downey and Fellows [44], is an exciting and interesting approach to deal with NP-complete problems. The underlying idea of this approach is to isolate some aspects or parts of the input (known as the parameters) to investigate whether these parameters make the problem tractable or intractable. The main goal of this thesis is to study the parameterized complexity of our packing problems with overlap. We set up as a parameter k the size of the solution (number of communities), and we consider as fixed-constants r, m and t. We show that our problems admit polynomial kernels via two types of techniques: polynomial parametric transformations (PPTs) [16] and classical reduction algorithms [43]. PPTs are mainly used to show lower bounds and as far as we know they have not been used as extensively to obtain kernel results as classical kernelization techniques [96, 42]. Thus, we believe that employing PPTs is a promising approach to obtain kernel reductions for other problems as well. On the other hand, with non-trivial generalizations of kernelization algorithms for the classical H-Packing problem [114], we are able to improve our kernel sizes obtained via PPTs. These improved kernel sizes are equivalent to the kernel sizes for the disjoint version when t = 0 and t = 1 for the t-Overlap and t-Membership problems, respectively. We also obtain fixed-parameter algorithms for our packing problems with overlap (other than running brute force on the kernel). Our algorithms combine a search tree and a greedy localization technique and generalize a fixed-parameter algorithm for the problem of packing disjoint triangles [54]. In addition, we obtain faster FPT-algorithms by transforming our overlapping problems into an instance of the disjoint version of our problems. Finally, we introduce the Π-Packing with α()-Overlap problem to allow for more complex overlap constraints than the ones considered by the t-Overlap and t-Membership problems and also to include more general communities definitions. This problem seeks at least k induced subgraphs in a graph G subject to: each subgraph has at most r vertices and obeys a property Π (a community definition) and for any pair of subgraphs Hi,Hj, with i≠j, we have that α(Hi,Hj) = 0 holds (an overlap constraint). We show that the Π-Packing with α()-Overlap problem is fixed-parameter tractable provided that Π is computable in polynomial time in n and α() obeys some natural conditions. Motivated by practical applications we give several examples of α() functions which meet those conditions