A binary code with the same weight distribution as its dual code is called formally self-dual (f.s.d.). We only consider f.s.d. even codes (codes with only even weight codewords). We show that any formally self-dual even binary code C of length n not divisible by 8 is balanced. We show that the weight distribution of a balanced near-extremal f.s.d. even code of length a multiple of 8 is unique....

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 consider the issue of update in settings for preference aggregation under preference changes. While the traditional problem formulation of preference aggregation assumes a fixed set of preference orders and a fixed set of domain elements we investigate how an aggregated preference order has to be updated when the input orders are dynamic. Our analysis shows that for even for some simple aggr...

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).

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...

We investigate the following very simple load-balancing algorithm on the N-cycle (N even) which we call Odd-Even Transposition Balancing (OETB). The edges of the cycle are partitioned into two matchings canonically. A matching defines a single step, the two matchings form a single round. Processors connected by an edge of the matching perfectly balance their loads, and, if there is an excess to...

Trus paper is concerned with the average rUDDing time of Batcher's odd-even merge sort when implemented on a collection of processors. We consider the case where n, the size of the input, is an arbitrary multiple of the number p of processors used. We show that Batcher's odd-even merge (for two sorted lists of length n each) can be implemented to run in time O«nlp)(log(2 + p2 In))) on the avera...