In this paper we test how efficiently state-of-the art solvers are capable of solving credulous and sceptical argument-acceptance for lower-order extensions. As our benchmark we consider two different random graph-models to obtain random Abstract Argumentation Frameworks with small-world characteristics: Kleinberg and Watt-Strogatz. We test two reasoners, i.e., ConArg2 and dynPARTIX, on such be...

We prove that the maximum edge biclique problem in bipartite graphs is NP-complete. A biclique in a bipartite graph is a vertex induced subgraph which is complete. The problem of finding a biclique with a maximum number of vertices is known to be solvable in polynomial time but the complexity of finding a biclique with a maximum number of edges was still undecided.

KUNSOO PARK 1, School of Computer Science and Engineering, Seoul National University, Seoul 151-742, Korea, E-mail:[email protected] ABSTRACT: Given a set S of strings, a consensus string of S based on consensus error is a string w that minimizes the sum of the distances between w and all the strings in S. In this paper, we show that the problem of finding a consensus string based on conse...

We study statistical properties of an NP-complete problem, the subset sum, using the methods and concepts of statistical mechanics. The problem is a generalization of the number partitioning problem, which is also an NP-complete problem and has been studied in the physics literature. The asymptotic expressions for the number of solutions are obtained. These results applied to the number partiti...

The so-called synthesis problem consists in deciding for a class of nets whether a given graph is isomorphic to the case graph of some net and then constructing the net. This problem has been solved for various classes of nets, ranging from elementary nets to Petri nets. The general principle is to compute regions in the graph, i.e. subsets of nodes liable to represent extensions of places of a...