This paper introduces an approach to support different phases of the Even Swaps process by Preference Programming, which is a framework for modeling incomplete information within multiattribute value theory. In the approach, the Even Swaps process is carried out as usual, but in parallel the preferences of the decision maker are modeled with a Preference Programming model, which is also updated...

We compute the backscattered current in a double point-contact geometry of a quantum-Hall system at filling fraction =5 /2 as a function of bias voltage in the weak backscattering regime. We assume that the system is in the universality class of either the Pfaffian or anti-Pfaffian state. When the number of charge e /4 quasiparticles in the interferometer is odd, there is no interference patter...

We describe efficient algorithms for finding even cycles in undirected graphs. Our main results are the following: (i) For every k ≥ 2, there is an O(V ) time algorithm that decides whether an undirected graph G = (V,E) contains a simple cycle of length 2k and finds one if it does. (ii) There is an O(V ) time algorithm that finds a shortest even cycle in an undirected graph G = (V,E).

For a 2-factor F of a connected graph G, we consider G − F , which is the graph obtained from G by removing all the edges of F . If G − F is connected, F is said to be a non-separating 2-factor. In this paper we study a sufficient condition for a 2r -regular connected graph G to have such a 2-factor. As a result, we show that a 2r -regular connected graph G has a non-separating 2-factor wheneve...

Problems of the following kind have been the focus of much recent research in the realm of parameterized complexity: Given an input graph (digraph) on n vertices and a positive integer parameter k, find if there exist k edges (arcs) whose deletion results in a graph that satisfies some specified parity constraints. In particular, when the objective is to obtain a connected graph in which all th...