Suchergebnisse - "NP-complete problems"

A Formal Verification of a SAT Solution by P Systems with Evolution Communication and Separation Rules.

Autoren: Orellana-Martín, David Valencia-Cabrera, Luis Pérez-Jiménez, Mario J.

Quelle: International Journal of Foundations of Computer Science. Nov2025, Vol. 36 Issue 7, p1089-1116. 28p.

Schlagwörter: SATISFIABILITY (Computer science), NP-complete problems, COMPUTATIONAL complexity

Complexity and structural results for the hull and convexity numbers in cycle convexity for graph products.

Autoren: Anand, Bijo S. Chandran S.V., Ullas Nascimento, Julliano R. et al.

Quelle: Discrete Applied Mathematics. Dec2025, Vol. 377, p552-561. 10p.

Schlagwörter: *NP-complete problems, *GRAPH theory, *CONVEX sets

Generalized paths and cycles in semicomplete multipartite digraphs.

Autoren: Bang-Jensen, Jørgen Wang, Yun Yeo, Anders

Quelle: Discrete Applied Mathematics. Dec2025, Vol. 377, p459-479. 21p.

Schlagwörter: *NP-complete problems, *HAMILTONIAN graph theory, *POLYNOMIAL time algorithms, *COMPUTATIONAL complexity, *DIRECTED graphs

The proper conflict-free [formula omitted]-coloring problem and the odd [formula omitted]-coloring problem are NP-complete on bipartite graphs.

Autoren: Ahn, Jungho Im, Seonghyuk Oum, Sang-il

Quelle: Discrete Applied Mathematics. Dec2025, Vol. 377, p10-17. 8p.

Schlagwörter: *NP-complete problems, *BIPARTITE graphs, *PLANAR graphs, *GRAPH coloring, *GRAPH theory

Total Roman domination and total domination in unit disk graphs.

Autoren: Rout, Sasmita Mishra, Pawan Kumar Das, Gautam Kumar

Quelle: Communications in Combinatorics & Optimization. Dec2025, Vol. 10 Issue 4, p803-823. 21p.

Schlagwörter: *GRAPH theory, *NP-complete problems, *SUBGRAPHS, *APPROXIMATION algorithms

On two double type domination invariants of trees.

Autoren: Şahi̇n, Bünyami̇n Şahi̇n, Abdulgani̇

Quelle: Discrete Mathematics, Algorithms & Applications. Nov2025, p1. 13p.

Schlagwörter: *TREES, *NP-complete problems, *MATHEMATICAL equivalence, *GRAPH theory, *BIPARTITE graphs

Transitions in dynamic point labeling.

Autoren: Depian, Thomas Li, Guangping Nöllenburg, Martin et al.

Quelle: Cartography & Geographic Information Science. Nov2025, p1-26. 26p. 17 Illustrations.

Schlagwörter: *NP-complete problems, *GEOTAGGING, *PROTOTYPES, *SCIENTIFIC method

Computational and approximation complexities of MINNAESAT variants.

Autoren: Jena, Sangram K. Subramani, K.

Quelle: Discrete Mathematics, Algorithms & Applications. Nov2025, p1. 17p.

Schlagwörter: *NP-complete problems, *COMPUTATIONAL complexity, *CONSTRAINT satisfaction, *APPROXIMATION algorithms, *APPROXIMATION error, *MATHEMATICAL optimization, *SATISFIABILITY (Computer science)

On open-separating dominating codes in graphs.

Autoren: Chakraborty, Dipayan Wagler, Annegret K.

Quelle: Discrete Applied Mathematics. Nov2025, Vol. 375, p215-238. 24p.

Schlagwörter: *NP-complete problems, *POLYHEDRA, *NEIGHBORHOODS, *HARDNESS, *FAMILIES

求解抽象辩论框架稳定扩充的长记忆禁忌搜索算法.

Alternate Title: Long-memory tabu search algorithm for stable extensions in abstract argumentation frameworks.

Autoren: 吴歆韵 孙俊杰 熊才权 et al.

Quelle: Application Research of Computers / Jisuanji Yingyong Yanjiu. Nov2025, Vol. 42 Issue 11, p3316-3324. 9p.

Schlagwörter: *NP-complete problems, *METAHEURISTIC algorithms, *ALGORITHMS

The K-edge metric dimension of a graph.

Autoren: Goshi, Nosheen Zafar, Sohail Rashid, Tabasam

Quelle: Discrete Mathematics, Algorithms & Applications. Oct2025, p1. 16p.

Schlagwörter: *GRAPH theory, *NP-complete problems, *GRAPH connectivity, *DETECTORS

Partitioning vertices of graphs into paths of the same length.

Autoren: Duginov, Oleg Malyshev, Dmitriy Mokeev, Dmitriy

Quelle: Discrete Applied Mathematics. Oct2025, Vol. 373, p179-195. 17p.

Schlagwörter: *NP-complete problems, *COMPUTATIONAL complexity, *POLYNOMIALS

Independent [$k$]-Roman domination on graphs.

Autoren: Luiz, Atílio Vieira, Francisco Anderson

Quelle: Discussiones Mathematicae: Graph Theory. 2025, Vol. 45 Issue 4, p1249-1272. 24p.

Schlagwörter: *GRAPH theory, *NP-complete problems, *BIPARTITE graphs, *REGULAR graphs

Winning is not the only metric: the complexity of control manipulation in knockout tournaments for a redefined goal.

Autoren: Daltrophe, Hadassa Shrot, Tammar Aronshtam, Lior

Quelle: International Transactions in Operational Research. May2025, p1. 18p. 3 Illustrations.

Schlagwörter: *POWER (Social sciences), COMPUTATIONAL complexity, NP-complete problems, TOURNAMENTS, INTENTION, WEIGHTED graphs, GOAL (Psychology)

Dicke State Quantum Search for Solving the Vertex Cover Problem.

Autoren: Jiang, Jehn-Ruey¹ (AUTHOR)

Quelle: Mathematics (2227-7390). Sep2025, Vol. 13 Issue 18, p3005. 28p.

Schlagwörter: *NP-complete problems, *POLYNOMIAL time algorithms, *COMBINATORIAL optimization, *QUANTUM computing, *QUANTUM superposition

The Price of Upwardness.

Autoren: Angelini, Patrizio Biedl, Therese Chimani, Markus et al.

Quelle: Discrete Mathematics & Theoretical Computer Science (DMTCS). 2025, Vol. 27 Issue 3, p1-30. 30p.

Schlagwörter: *DIRECTED acyclic graphs, *NP-complete problems

Reallocation Problems with Minimum Completion Time.

Autoren: Ishii, Toshimasa Kawahara, Jun Makino, Kazuhisa et al.

Quelle: Algorithmica. Sep2025, Vol. 87 Issue 9, p1311-1339. 29p.

Schlagwörter: *SUPPLY chain management, *NP-complete problems, *TRANSPORTATION engineering, *SCHEDULING, *LOGISTICS, *BIN packing problem, *RESOURCE allocation

On the Keevash-Knox-Mycroft conjecture.

Autoren: Gan, Luyining Han, Jie

Quelle: Journal of Combinatorial Theory - Series B. Sep2025, Vol. 174, p214-242. 29p.

Schlagwörter: *NP-complete problems, *STATISTICAL decision making, *COMPUTATIONAL complexity, *LOGICAL prediction, *HYPERGRAPHS, *ALGORITHMS

Inductive inference of lindenmayer systems: algorithms and computational complexity.

Autoren: Duffy, Christopher Hillis, Sam Khan, Umer et al.

Quelle: Natural Computing. Sep2025, Vol. 24 Issue 3, p591-601. 11p.

Schlagwörter: *COMPUTATIONAL complexity, *NP-complete problems, *PATTERN perception, *PARALLEL processing, *SYNTAX in programming languages, *MACHINE learning, *FORMAL languages

Three results towards approximation of special maximum matchings in graphs.

Autoren: Mkrtchyan, Vahan¹ (AUTHOR) vahan.mkrtchyan@gssi.it

Quelle: Discrete Applied Mathematics. Aug2025, Vol. 371, p127-136. 10p.

Schlagwörter: *POLYNOMIAL time algorithms, *NP-complete problems, *STATISTICAL decision making, *ALGORITHMS, *APPROXIMATION algorithms