Maximizing Expectation on Vertex-Disjoint Cycle Packing
نویسنده
چکیده
This paper proposes a method for computing the expectation for the length of the maximum set of vertex-disjoint cycles in a digraph where vertices and/or arcs are subject to failure with a known probability. This method has an immediate practical application: it can be used for the solution of a kidney exchange program in the common situation where the underlying graph is unreliable. Results for realistic benchmark instances are reported and analyzed.
منابع مشابه
Kernelization of Cycle Packing with Relaxed Disjointness Constraints
A key result in the field of kernelization, a subfield of parameterized complexity, states that the classic Disjoint Cycle Packing problem, i.e. finding k vertex disjoint cycles in a given graph G, admits no polynomial kernel unless NP ⊆ coNP/poly. However, very little is known about this problem beyond the aforementioned kernelization lower bound (within the parameterized complexity framework)...
متن کاملFixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem
We investigate generalizations of the following well-known problems in the framework of parameterized complexity: the feedback set problem and the cycle packing problem. Our problem setting is that we are given a graph and a vertex set S called “terminals”. Our purpose here is to consider the following problems: 1. The feedback set problem with respect to the terminals S. We call it the subset ...
متن کاملErdös-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
The well-known Erdős-Pósa theorem says that for any integer k and any graph G, either G contains k vertexdisjoint cycles or a vertex setX of order at most c·k log k (for some constant c) such that G−X is a forest. Thomassen [39] extended this result to the even cycles, but on the other hand, it is well-known that this theorem is no longer true for the odd cycles. However, Reed [31] proved that ...
متن کاملDisjoint Even Cycles Packing
We generalize the well-known theorem of Corrádi and Hajnal which says that if a given graph G has at least 3k vertices and the minimum degree of G is at least 2k, then G contains k vertex-disjoint cycles. Our main result is the following; for any integer k, there is an absolute constant ck satisfying the following; let G be a graph with at least ck vertices such that the minimum degree of G is ...
متن کاملMaximum cycle packing in Eulerian graphs using local traces
For a graph G = (V,E) and a vertex v ∈ V , let T (v) be a local trace at v, i.e. T (v) is an Eulerian subgraph of G such that every walk W (v), with start vertex v can be extended to an Eulerian tour in T (v). We prove that every maximum edge-disjoint cycle packing Z∗ of G induces a maximum trace T (v) at v for every v ∈ V . Moreover, if G is Eulerian then sufficient conditions are given that g...
متن کامل