Results 41 to 50 of about 369,293 (294)

A Note on Polynomial Algorithm for Cost Coloring of Bipartite Graphs with Δ ≤ 4

Discussiones Mathematicae Graph Theory, 2020
In the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex.
Giaro Krzysztof, Kubale Marek
doaj   +1 more source

NP-completeness and One Polynomial Subclass of the Two-Step Graph Colouring Problem

Моделирование и анализ информационных систем, 2019
In this paper, we study the two-step colouring problem for an undirected connected graph. It is required to colour the graph in a given number of colours in a way, when no pair of vertices has the same colour, if these vertices are at a distance of 1 or ...
Natalya Sergeevna Medvedeva, Alexander Valeryevich Smirnov   +1 more
doaj   +1 more source

Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts [PDF]

Discrete Mathematics & Theoretical Computer Science, 2017
Total dominating set, connected vertex cover and Steiner tree are well-known graph problems. Despite the fact that they are NP-complete to optimize, it is easy (even trivial) to find solutions, regardless of their size.
Alexis Cornet, Christian Laforest
doaj   +1 more source

A context‐dependent modulatory role for eIF6 in acquired resistance to vemurafenib in melanoma

FEBS Letters, EarlyView.
Acquired resistance to vemurafenib upregulates the translation factor eIF6 in melanoma cells. Silencing eIF6 in resistant cells reduces proliferation and partially restores drug sensitivity, whereas its overexpression increases sensitivity across melanoma lines regardless of BRAF status, via modulation of mTOR, S6K, and MAPK signaling.
George Kyriakopoulos, Antonia Petropoulou, Alexandra Anastogianni, Angelina Bania, Vassilis Stamatakis, Argyris Alexiou, Chi‐Ping Day, Glenn Merlino, Katerina Grafanaki, Constantinos Stathopoulos   +9 more
wiley   +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  

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

IMPDH inhibition enhances cytarabine efficacy in SAMHD1‐expressing leukaemia cells via guanine nucleotide depletion

Molecular Oncology, EarlyView.
Cytarabine is a key therapy for acute myeloid leukaemia (AML), but its efficacy is limited by the dNTPase SAMHD1, which hydrolyses its active metabolite. Screening nucleotide biosynthesis inhibitors revealed that IMPDH inhibitors selectively sensitise SAMHD1‐proficient AML cells to cytarabine.
Miriam Yagüe‐Capilla, Christopher Dirks, Caroline Eiden, Sonja K. Fesenmayer, Femke M. Hormann, Yolande Klootsema, Ingrid Lilienthal, Si Min Zhang, Nikolas Herold, Sean G. Rudd   +9 more
wiley   +1 more source

NP-Completeness of mine planning under logical environmental constraints

Applied Computing and Geosciences
Environmental constraints in mine planning exhibit logical interdependence that linear inequalities cannot capture. This paper formalizes the Environmentally Constrained Mine Planning Problem (ECMPP) with environmental conditions as Boolean predicates in
Raymond Kudzawu-D’Pherdd, Johnson Nuviadenu, Devan Neil, Elynam Kudzawu-D’Pherdd, Johanna H. Linus, Emmanuel Romaric Ouabo   +5 more
doaj   +1 more source

Even Simple Processes of π-calculus are Hard for Analysis

Моделирование и анализ информационных систем, 2018
Mathematical models of distributed computations, based on the calculus of mobile processes (π-calculus) are widely used for checking the information security properties of cryptographic protocols.
Marat M. Abbas, Vladimir A. Zakharov
doaj   +1 more source

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, Odette M. Mendez, Juan-Carlos Riaño-Rojas, Juan-David Hormaza   +3 more
doaj   +1 more source