Results 31 to 40 of about 272,983 (311)
CoRR, 2023 Nondango is a pencil puzzle consisting of a rectangular grid partitioned into regions, with some cells containing a white circle. The player has to color some circles black such that every region contains exactly one black circle, and there are no three consecutive circles (horizontally, vertically, or diagonally) having the same color.
openaire +2 more sources
Version Spaces, Structural Descriptions and NP-Completeness
, 2018 Kevin T. Kelly.
Kevin T. Kelly (362540)
core +1 more source
NP-completeness of weakly convex and convex dominating set decision problems [PDF]
Opuscula Mathematica, 2004 The convex domination number and the weakly convex domination number are new domination parameters. In this paper we show that the decision problems of convex and weakly convex dominating sets are \(NP\)-complete for bipartite and split graphs.
Joanna Raczek
doaj
An Algebraic Approach to the Solutions of the Open Shop Scheduling Problem
Computation, 2023 The open shop scheduling problem (OSSP) is one of the standard scheduling problems. It consists of scheduling jobs associated with a finite set of tasks developed by different machines. In this case, each machine processes at most one operation at a time,
Agustín Moreno Cañadas +3 more
doaj +1 more source
NP-completeness of Bipartite Exact Cut
, 2019 \textsc{Max-Cut} is a well-known NP-complete problem in which, given a graph $G$ and an integer $k$, one needs to determine whether there exists a cut of size at least $k$ in $G$. An exact version is likewise asking whether $G$ has a cut of size exactly $
Thinh D. Nguyen (6385907)
core +1 more source
Complexity results for the gap inequalities for the max-cut problem [PDF]
, 2012 We prove several complexity results about the gap inequalities for the max-cut problem, including (i) the gap-1 inequalities do not imply the other gap inequalities, unless NP=Co NP; (ii) there must exist non-redundant gap inequalities with exponentially
Galli, Laura +3 more
core +1 more source
NP-Completeness in the gossip monoid [PDF]
International Journal of Algebra and Computation, 2018 Gossip monoids form an algebraic model of networks with exclusive, transient connections in which nodes, when they form a connection, exchange all known information. They also arise naturally in pure mathematics, as the monoids generated by the set of all equivalence relations on a given finite set under relational composition.
Peter Fenner +2 more
openaire +5 more sources
k-L(2, 1)-labelling for planar graphs is NP-complete for k>=4
, 2009 A mapping from the vertex set of a graph G=(V,E) into an interval of integers {0,...,k} is an L(2,1)-labelling of G of span k if any two adjacent vertices are mapped onto integers that are at least 2 apart, and every two vertices with a common ...
Noble, Steven +8 more
core +1 more source
Network Model for The Problem of Integer Balancing of a Fourdimensional Matrix
Моделирование и анализ информационных систем, 2016 The problem of integer balancing of a four-dimensional matrix is studied. The elements of the inner part (all four indices are greater than zero) of the given real matrix are summed in each direction and each two- and three-dimensional section of the ...
A. V. Smirnov
doaj +1 more source
Negative results on acyclic improper colorings [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Raspaud and Sopena showed that the oriented chromatic number of a graph with acyclic chromatic number $k$ is at most $k2^{k-1}$. We prove that this bound is tight for $k \geq 3$.
Pascal Ochem
doaj +1 more source