96 search results - page 3 / 20 » On the Complexity of Deciding Avoidability of Sets of Partia... |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Deciding whether a graph can be embedded in a grid using only unitlength edges is NP-complete, even when restricted to binary trees. However, it is not difficult to devise a numbe...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
In the algebraic theory of codes and formal languages, the set Q of all primitive words over some alphabet Σ has received special interest. With this survey article we give an ove...
ALGORITHMICA
2006
13 years 7 months ago
2006
We consider the problem of coloring a planar graph with the minimum number of colors so that each color class avoids one or more forbidden graphs as subgraphs. We perform a detail...
DEON
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. In this paper, we present an adaptive logic for deontic conflicts, called P2.1r , that is based on Goble’s logic SDLaPe—a bimodal extension of Goble’s logic P that...
GLOBECOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— Space-time codes from complex orthogonal designs (CODs) with no zero entries offer low Peak to Average power ratio (PAPR) and avoid the problem of turning off antennas. But COD...