SearcharxivSearch

arXiv subjects

Daniel Paulusma

Publications and source records attributed to Daniel Paulusma.

At least 19 recordsLinked to original sources

Complexity and Manipulation of International Kidney Exchange Programmes with Country-Specific Parameters

Kidney Exchange Programmes (KEPs) facilitate the exchange of kidneys, and larger pools of recipient-donor pairs tend to yield proportionally more transplants, leading to the proposal of international KEPs (IKEPs). However, as studied by \citet{mincu2021ip}, practical limitations must be considered in IKEPs to ensure that countries remain willing to participate. Thus, we study IKEPs with country-specific parameters, represented by a tuple $\Gamma$, restricting the selected transplants to be feasible for the countries to conduct, e.g., imposing an upper limit on the number of consecutive exchanges within a country's borders. We provide a complete complexity dichotomy for the problem of finding a feasible (according to the constraints given by $\Gamma$) cycle packing with the maximum number of transplants, for every possible $\Gamma$. We also study the potential for countries to misreport their parameters to increase their allocation. As manipulation can harm the total number of transplants, we propose a novel individually rational and incentive compatible mechanism $\mathcal{M}_{\text{order}}$. We first give a theoretical approximation ratio for $\mathcal{M}_{\text{order}}$ in terms of the number of transplants, and show that the approximation ratio of $\mathcal{M}_{\text{order}}$ is asymptotically optimal. We then use simulations which suggest that, in practice, the performance of $\mathcal{M}_{\text{order}}$ is significantly better than this worst-case ratio.

cs.GT

Complexity Framework For Forbidden Subgraphs V: Beyond Simple Graphs

We continue the study of the recently-introduced C123-framework, for (simple) graph problems restricted to inputs specified by the forbidding of some finite set of subgraphs, to more general graph problems possibly involving multiedges and self-loops. We study specifically the problems Multigraph Matching Cut, Multigraph d-Cut and Partially Reflexive Stable Cut in this connection. The last may be seen as a Surjective Homomorphism problem to a path P_3 in which both leaves are looped while the interior vertex is loopless. We consider also another family of Surjective Homomorphism problems to a cycle in which only one vertex is loopless. When one forbids a single (simple) subgraph, our first three problems exhibit the same complexity behaviour as C123-problems, but on finite sets of forbidden subgraphs, the classification appears more complex. While Multigraph Matching Cut and Multigraph d-Cut have the same classification as C123-problems, already Partially Reflexive Stable Cut fails to have. This is witnessed by forbidding as subgraphs both C_3 and H_1. Indeed, the difference of behaviour occurs only around pendant subdivisions of nets and pendant subdivisions of H_1. We examine this area in close detail. Our other Surjective Homomorphism problem, ostensibly somewhat similar to Partially Reflexive Stable Cut, behaves very differently when the input is restricted to some class that is H-subgraph-free. For example, it is solvable in polynomial time on any class of bounded degree. Also, its hardness will never be preserved under any form of edge subdivision.

math.CO

Graph Homomorphism, Monotone Classes and Bounded Pathwidth

In recent work by Johnson et al. (2022), a framework was described for the study of graph problems over classes specified by omitting each of a finite set of graphs as subgraphs. If a problem falls into the framework then its computational complexity can be described for all such graph classes, giving a dichotomy between those classes for which the problem is hard and those for which it is easy. In this article, we consider several variants of the homomorphism problem in relation to this framework. It is known that certain homomorphism problems, e.g. $C_5$-Colouring, do not sit in the framework. By contrast, we show that the more general problem of Graph Homomorphism does sit in the framework, with hard cases NP-complete and easy cases in P. We go on to consider several locally constrained variants of the homomorphism problem, namely the locally bijective, surjective and injective variants. Like $C_5$-Colouring, none of these is in the framework. However, where a bounded-degree restrictions are considered, we prove that each of these problems is in our framework, with hard cases NP-complete and easy cases in P Next, we give the first example of a problem in the framework such that hardness is in the polynomial hierarchy above NP. This comes from a list colouring game, realised through first-order logic as quantified constraints. We show that with the additional restriction of bounded alternation, the problem is contained in the framework. The hard cases are $\Pi_{2k}^\mathrm{P}$-complete and the easy cases are in P. Finally, we go on to consider an aforementioned problem from our framework, complete for the second level of the polynomial hierarchy, under the omission in the input of not just a graph, but rather a graph $H$ annotated with the types for each vertex: existential or universal.

cs.CC

Matching Cuts in Graphs of High Girth and H-Free Graphs

The (Perfect) Matching Cut problem is to decide if a connected graph has a (perfect) matching that is also an edge cut. The Disconnected Perfect Matching problem is to decide if a connected graph has a perfect matching that contains a matching cut. Both Matching Cut and Disconnected Perfect Matching are NP-complete for planar graphs of girth 5, whereas Perfect Matching Cut is known to be NP-complete even for subcubic bipartite graphs of arbitrarily large fixed girth. We prove that Matching Cut and Disconnected Perfect Matching are also NP-complete for bipartite graphs of arbitrarily large fixed girth and bounded maximum degree. Our result for Matching Cut resolves a 20-year old open problem. We also show that the more general problem $d$-Cut, for every fixed $d \geq 1$, is NP-complete for bipartite graphs of arbitrarily large fixed girth and bounded maximum degree. Furthermore, we show that Matching Cut, Perfect Matching Cut and Disconnected Perfect Matching are NP-complete for $H$-free graphs whenever $H$ contains a connected component with two vertices of degree at least 3. Afterwards, we update the state-of-the-art summaries for $H$-free graphs and compare them with each other, and with a known and full classification of the Maximum Matching Cut problem, which is to determine a largest matching cut of a graph $G$. Finally, by combining existing results, we obtain a complete complexity classification of Perfect Matching Cut for $H$-subgraph-free graphs where $H$ is any finite set of graphs.

math.CO

Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem

We study Steiner Forest on $H$-subgraph-free graphs, that is, graphs that do not contain some fixed graph $H$ as a (not necessarily induced) subgraph. We are motivated by a recent framework that completely characterizes the complexity of many problems on $H$-subgraph-free graphs. However, in contrast to e.g. the related Steiner Tree problem, Steiner Forest falls outside this framework. Hence, the complexity of Steiner Forest on $H$-subgraph-free graphs remained tantalizingly open. In this paper, we make significant progress towards determining the complexity of Steiner Forest on $H$-subgraph-free graphs. Our main results are four novel polynomial-time algorithms for different excluded graphs $H$ that are central to further understand its complexity. Along the way, we study the complexity of Steiner Forest for graphs with a small $c$-deletion set, that is, a small set $S$ of vertices such that each component of $G-S$ has size at most $c$. Using this parameter, we give two noteworthy algorithms that we later employ as subroutines. First, we prove Steiner Forest is FPT parameterized by $|S|$ when $c=1$ (i.e. the vertex cover number). Second, we prove Steiner Forest is polynomial-time solvable for graphs with a 2-deletion set of size at most 2. The latter result is tight, as the problem is NP-complete for graphs with a 3-deletion set of size 2.

math.CO

Complexity Framework for Forbidden Subgraphs II: Edge Subdivision and the "H"-graphs

For a fixed set ${\cal H}$ of graphs, a graph $G$ is ${\cal H}$-subgraph-free if $G$ does not contain any $H \in {\cal H}$ as a (not necessarily induced) subgraph. A recently proposed framework gives a complete classification on ${\cal H}$-subgraph-free graphs (for finite sets ${\cal H}$) for problems that are solvable in polynomial time on graph classes of bounded treewidth, NP-complete on subcubic graphs, and whose NP-hardness is preserved under edge subdivision. While a lot of problems satisfy these conditions, there are also many problems that do not satisfy all three conditions and for which the complexity in ${\cal H}$-subgraph-free graphs is unknown. We study problems for which only the first two conditions of the framework hold (they are solvable in polynomial time on classes of bounded treewidth and NP-complete on subcubic graphs, but NP-hardness is not preserved under edge subdivision). In particular, we make inroads into the classification of the complexity of four such problems: Hamilton Cycle, $k$-Induced Disjoint Paths, $C_5$-Colouring and Star $3$-Colouring. Although we do not complete the classifications, we show that the boundary between polynomial time and NP-complete differs among our problems and also from problems that do satisfy all three conditions of the framework, in particular when we forbid certain subdivisions of the ``H''-graph (the graph that looks like the letter ``H''). Hence, we exhibit a rich complexity landscape among problems for ${\cal H}$-subgraph-free graph classes.

cs.DM

The complexity of L(p,q)-Edge-Labelling

We consider the L(p,q)-Edge-Labelling problem, which is the edge variant of the well-known L(p,q)-Labelling problem. So far, the complexity of this problem was only partially classified. We complete this study for all nonnegative p and q, by showing that, whenever (p,q) is not (0,0), L(p,q)-Edge-Labelling problem is NP-complete. We do this by proving that for all nonnegative p and q, except p=q=0, there exists an integer k so that L(p,q)-Edge-k-Labelling is NP-complete.

cs.DM

QCSP on Reflexive Tournaments

We give a complexity dichotomy for the Quantified Constraint Satisfaction Problem QCSP(H) when H is a reflexive tournament. It is well-known that reflexive tournaments can be split into a sequence of strongly connected components H_1,...,H_n so that there exists an edge from every vertex of H_i to every vertex of H_j if and only if i<j. We prove that if H has both its initial and final strongly connected component (possibly equal) of size 1, then QCSP(H) is in NL and otherwise QCSP(H) is NP-hard.

cs.CC

Colouring Generalized Claw-Free Graphs and Graphs of Large Girth: Bounding the Diameter

For a fixed integer, the $k$-Colouring problem is to decide if the vertices of a graph can be coloured with at most $k$ colours for an integer $k$, such that no two adjacent vertices are coloured alike. A graph $G$ is $H$-free if $G$ does not contain $H$ as an induced subgraph. It is known that for all $k\geq 3$, the $k$-Colouring problem is NP-complete for $H$-free graphs if $H$ contains an induced claw or cycle. The case where $H$ contains a cycle follows from the known result that the problem is NP-complete even for graphs of arbitrarily large fixed girth. We examine to what extent the situation may change if in addition the input graph has bounded diameter.

math.CO

What Graphs are 2-Dot Product Graphs?

Let $d \geq 1$ be an integer. From a set of $d$-dimensional vectors, we obtain a $d$-\dpg\ by letting each vector $\va^u$ correspond to a vertex $u$ and by adding an edge between two vertices $u$ and $v$ if and only if their dot product $\va^{u} \cdot \va^{v} \geq t$, for some fixed, positive threshold~$t$. Dot product graphs can be used to model social networks. Recognizing a $d$-dot product graph is known to be \NP-hard for all fixed $d\geq 2$. To understand the position of $d$-dot product graphs in the landscape of graph classes, we consider the case $d=2$, and investigate how $2$-dot product graphs relate to a number of other known graph classes including a number of well-known classes of intersection graphs.

math.CO

Computing Weighted Subset Transversals in $H$-Free Graphs

For the Odd Cycle Transversal problem, the task is to find a small set $S$ of vertices in a graph that intersects every cycle of odd length. The Subset Odd Cycle Transversal problem requires S to intersect only those odd cycles that include a vertex of a distinguished vertex subset $T$. If we are given weights for the vertices, we ask instead that $S$ has small weight: this is the problem Weighted Subset Odd Cycle Transversal. We prove an almost-complete complexity dichotomy for Weighted Subset Odd Cycle Transversal for graphs that do not contain a graph $H$ as an induced subgraph. Our general approach can also be used for Weighted Subset Feedback Vertex Set, which enables us to generalize a recent result of Papadopoulos and Tzimas.

cs.DS

Colouring Graphs of Bounded Diameter in the Absence of Small Cycles

For $k\geq 1$, a $k$-colouring $c$ of $G$ is a mapping from $V(G)$ to $\{1,2,\ldots,k\}$ such that $c(u)\neq c(v)$ for any two non-adjacent vertices $u$ and $v$. The $k$-Colouring problem is to decide if a graph $G$ has a $k$-colouring. For a family of graphs ${\cal H}$, a graph $G$ is ${\cal H}$-free if $G$ does not contain any graph from ${\cal H}$ as an induced subgraph. Let $C_s$ be the $s$-vertex cycle. In previous work (MFCS 2019) we examined the effect of bounding the diameter on the complexity of $3$-Colouring for $(C_3,\ldots,C_s)$-free graphs and $H$-free graphs where $H$ is some polyad. Here, we prove for certain small values of $s$ that $3$-Colouring is polynomial-time solvable for $C_s$-free graphs of diameter $2$ and $(C_4,C_s)$-free graphs of diameter $2$. In fact, our results hold for the more general problem List $3$-Colouring. We complement these results with some hardness result for diameter $4$.

math.CO

List $k$-Colouring $P_t$-Free Graphs: a Mim-width Perspective

A colouring of a graph $G=(V,E)$ is a mapping $c\colon V\to \{1,2,\ldots\}$ such that $c(u)\neq c(v)$ for every two adjacent vertices $u$ and $v$ of $G$. The {\sc List $k$-Colouring} problem is to decide whether a graph $G=(V,E)$ with a list $L(u)\subseteq \{1,\ldots,k\}$ for each $u\in V$ has a colouring $c$ such that $c(u)\in L(u)$ for every $u\in V$. Let $P_t$ be the path on $t$ vertices and let $K_{1,s}^1$ be the graph obtained from the $(s+1)$-vertex star $K_{1,s}$ by subdividing each of its edges exactly once.Recently, Chudnovsky, Spirkl and Zhong (DM 2020) proved that List $3$-Colouring is polynomial-time solvable for $(K_{1,s}^1,P_t)$-free graphs for every $t\geq 1$ and $s\geq 1$. We generalize their result to List $k$-Colouring for every $k\geq 1$. Our result also generalizes the known result that for every $k\geq 1$ and $s\geq 0$, List $k$-Colouring is polynomial-time solvable for $(sP_1+P_5)$-free graphs, which was proven for $s=0$ by Hoàng, Kamiński, Lozin, Sawada, and Shu (Algorithmica 2010) and for every $s\geq 1$ by Couturier, Golovach, Kratsch and Paulusma (Algorithmica 2015). We show our result by proving boundedness of an underlying width parameter. Namely, we show that for every $k\geq 1$, $s\geq 1$, $t\geq 1$, the class of $(K_k,K_{1,s}^1,P_t)$-free graphs has bounded mim-width and that a corresponding branch decomposition is "quickly computable" for these graphs.

cs.DS

Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective

We consider the classical problems (Edge) Steiner Tree and Vertex Steiner Tree after restricting the input to some class of graphs characterized by a small set of forbidden induced subgraphs. We show a dichotomy for the former problem restricted to $(H_1,H_2)$-free graphs and a dichotomy for the latter problem restricted to $H$-free graphs. We find that there exists an infinite family of graphs $H$ such that Vertex Steiner Tree is polynomial-time solvable for $H$-free graphs, whereas there exist only two graphs $H$ for which this holds for Edge Steiner Tree. We also find that Edge Steiner Tree is polynomial-time solvable for $(H_1,H_2)$-free graphs if and only if the treewidth of the class of $(H_1,H_2)$-free graphs is bounded (subject to P $\neq$ NP). To obtain the latter result, we determine all pairs $(H_1,H_2)$ for which the class of $(H_1,H_2)$-free graphs has bounded treewidth.

cs.DS

Bounding the Mim-Width of Hereditary Graph Classes

A large number of NP-hard graph problems become polynomial-time solvable on graph classes where the mim-width is bounded and quickly computable. Hence, when solving such problems on special graph classes, it is helpful to know whether the graph class under consideration has bounded mim-width. We first extend the toolkit for proving (un)boundedness of mim-width of graph classes. This enables us to initiate a systematic study into bounding mim-width from the perspective of hereditary graph classes. For a given graph $H$, the class of $H$-free graphs has bounded mim-width if and only if it has bounded clique-width. We show that the same is not true for $(H_1,H_2)$-free graphs. We find several general classes of $(H_1,H_2)$-free graphs having unbounded clique-width, but the mim-width is bounded and quickly computable. We also prove a number of new results showing that, for certain $H_1$ and $H_2$, the class of $(H_1,H_2)$-free graphs has unbounded mim-width. Combining these with known results, we present summary theorems of the current state of the art for the boundedness of mim-width for $(H_1,H_2)$-free graphs.

cs.DS

Acyclic, Star and Injective Colouring: A Complexity Picture for H-Free Graphs

A (proper) colouring is acyclic, star, or injective if any two colour classes induce a forest, star forest or disjoint union of vertices and edges, respectively. Hence, every injective colouring is a star colouring and every star colouring is an acyclic colouring. The corresponding decision problems are Acyclic Colouring, Star Colouring and Injective Colouring (the last problem is also known as $L(1,1)$-Labelling). A classical complexity result on Colouring is a well-known dichotomy for $H$-free graphs (a graph is $H$-free if it does not contain $H$ as an induced subgraph). In contrast, there is no systematic study into the computational complexity of Acyclic Colouring, Star Colouring and Injective Colouring despite numerous algorithmic and structural results that have appeared over the years. We perform such a study and give almost complete complexity classifications for Acyclic Colouring, Star Colouring and Injective Colouring on $H$-free graphs (for each of the problems, we have one open case). Moreover, we give full complexity classifications if the number of colours $k$ is fixed, that is, not part of the input. From our study it follows that for fixed $k$ the three problems behave in the same way, but this is no longer true if $k$ is part of the input. To obtain several of our results we prove stronger complexity results that in particular involve the girth of a graph and the class of line graphs of multigraphs.

cs.DM

Colouring $(sP_1+P_5)$-Free Graphs: a Mim-Width Perspective

We prove that the class of $(K_t,sP_1+P_5)$-free graphs has bounded mim-width for every $s\geq 0$ and $t\geq 1$, and that there is a polynomial-time algorithm that, given a graph in the class, computes a branch decomposition of constant mim-width. A large number of \NP-complete graph problems become polynomial-time solvable on graph classes with bounded mim-width and for which a branch decomposition is quickly computable. The $k$-Colouring problem is an example of such a problem. For this problem, we may assume that the input graph is $K_{k+1}$-free. Then, as a consequence of our result, we obtain a new proof for the known result that for every fixed $k\geq 1$ and $s\geq 0$, $k$-Colouring is polynomial-time solvable for $(sP_1+P_5)$-free graphs. In fact, our findings show that the underlying reason for this polynomial-time algorithm is that the class has bounded mim-width.

cs.DS