Results 21 to 30 of about 369,293 (294)
New Results on Generalized Graph Coloring [PDF]
Discrete Mathematics & Theoretical Computer Science, 2004 For graph classes \wp_1,...,\wp_k, Generalized Graph Coloring is the problem of deciding whether the vertex set of a given graph G can be partitioned into subsets V_1,...,V_k so that V_j induces a graph in the class \wp_j (j=1,2,...,k).
Vladimir E. Alekseev +2 more
doaj +1 more source
NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
Моделирование и анализ информационных систем, 2021 In this paper, we study undirected multiple graphs of any natural multiplicity k > 1. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of k linked edges, which connect 2 or (k +
Alexander Valeryevich Smirnov
doaj +1 more source
P_4-Colorings and P_4-Bipartite Graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 A vertex partition of a graph into disjoint subsets V_is is said to be a P_4-free coloring if each color class V_i induces a subgraph without chordless path on four vertices (denoted by P_4).
Chinh T. Hoàng, Van Bang Le
doaj +1 more source
Graphs of intersections of closed polygonal chains
Журнал Белорусского государственного университета: Математика, информатика, 2021 In the paper such subclass of string graphs as intersection graphs of closed polygonal chains (class of CPC-graphs) was considered, necessary conditions for belonging to that class, forbidden subgraphs and operations with graphs which preserve belonging ...
Nikolai P. Prochorov, Ekaterina N. Dul
doaj +1 more source
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
AN NP-COMPLETE FRAGMENT OF LTL [PDF]
International Journal of Foundations of Computer Science, 2004 A fragment of linear time temporal logic (LTL) is presented. It is proved that the satisfiability problem for this fragment is NP-complete. The fragment is larger than previously known NP-complete fragments. It is obtained by prohibiting the use of until operator and requiring to use only next operators indexed by a letter.
Muscholl, Anca, Walukiewicz, Igor
openaire +4 more sources
Separating NP-Completeness Notions under Strong Hypotheses [PDF]
, 2000 Lutz (1993, “Proceedings of the Eight Annual Conference on Structure in Complexity Theory,” pp. 158–175) proposed the study of the structure of the class NP=NTIME(poly) under the hypothesis that NP does not have p-measure 0 (with respect to Lutz's ...
Bentzien, Levke, Ambos-Spies, Klaus
core +1 more source
On Basing One-way Permutations on NP-hard Problems under Quantum Reductions [PDF]
Quantum, 2020 A fundamental pursuit in complexity theory concerns reducing worst-case problems to average-case problems. There exist complexity classes such as PSPACE that admit worst-case to average-case reductions.
Nai-Hui Chia, Sean Hallgren, Fang Song
doaj +1 more source
Clique Transversal Variants on Graphs: A Parameterized-Complexity Perspective
Mathematics, 2023 The clique transversal problem and its variants have garnered significant attention in the last two decades due to their practical applications in communication networks, social-network theory and transceiver placement for cellular telephones.
Chuan-Min Lee
doaj +1 more source
Nonuniform Reductions and NP-Completeness
Theory of Computing Systems, 2022 Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger complexity classes.
John M. Hitchcock, Hadi Shafei
openaire +6 more sources