12 research outputs found
Degree Sequence Optimization in Bounded Treewidth
We consider the problem of finding a subgraph of a given graph which
minimizes the sum of given functions at vertices evaluated at their subgraph
degrees. While the problem is NP-hard already when all functions are the same,
we show that it can be solved for arbitrary functions in polynomial time over
graphs of bounded treewidth. Its complexity remains widely open, in particular
over complete graphs and complete bipartite graphs
On null 3-hypergraphs
International audienceGiven a 3-uniform hypergraph H consisting of a set V of vertices, and T ⊆ V 3 triples, a null labelling is an assignment of ±1 to the triples such that each vertex is contained in an equal number of triples labelled +1 and −1. Thus, the signed degree of each vertex is zero. A necessary condition for a null labelling is that the degree of every vertex of H is even. The Null Labelling Problem is to determine whether H has a null labelling. It is proved that this problem is NP-complete. Computer enumerations suggest that most hypergraphs which satisfy the necessary condition do have a null labelling. Some constructions are given which produce hypergraphs satisfying the necessary condition, but which do not have a null labelling. A self complementary 3-hypergraph with this property is also constructed
Recommended from our members
Combinatorial Optimization
Combinatorial Optimization is an active research area that developed from the rich interaction among many mathematical areas, including combinatorics, graph theory, geometry, optimization, probability, theoretical computer science, and many others. It combines algorithmic and complexity analysis with a mature mathematical foundation and it yields both basic research and applications in manifold areas such as, for example, communications, economics, traffic, network design, VLSI, scheduling, production, computational biology, to name just a few. Through strong inner ties to other mathematical fields it has been contributing to and benefiting from areas such as, for example, discrete and convex geometry, convex and nonlinear optimization, algebraic and topological methods, geometry of numbers, matroids and combinatorics, and mathematical programming. Moreover, with respect to applications and algorithmic complexity, Combinatorial Optimization is an essential link between mathematics, computer science and modern applications in data science, economics, and industry