Results 1 to 10 of about 53,368 (164)

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, Alastair Farrugia, Vadim V. Lozin   +2 more
doaj   +1 more source

The Polynomial Algorithm of Finding the Shortest Path in a Divisible Multiple Graph

Моделирование и анализ информационных систем, 2022
In this paper, we study undirected multiple graphs of any natural multiplicity к > 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 к linked edges, which connect 2 or (к + 1)
Alexander Valeryevich Smirnov
doaj   +1 more source

The Optimized Algorithm of Finding the Shortest Path in a Multiple Graph

Моделирование и анализ информационных систем, 2023
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+1)
Alexander Valeryevich Smirnov
doaj   +1 more source

Edge Neighbor Toughness of Graphs

Axioms, 2022
A new graph parameter, edge neighbor toughness is introduced to measure how difficult it is for a graph to be broken into many components through the deletion of the closed neighborhoods of a few edges. Let G=(V,E) be a graph.
Xin Feng, Zongtian Wei, Yucheng Yang
doaj   +1 more source

Better polynomial algorithms for scheduling unit-length jobswith bipartite incompatibility graphs on uniform machines [PDF]

Bulletin of the Polish Academy of Sciences: Technical Sciences, 2019
The goal of this paper is to explore and to provide tools for the investigation of the problems of unit-length scheduling of incompatible jobs on uniform machines. We present two new algorithms that are a significant improvement over the known algorithms.
T. Pikies, M. Kubale
doaj   +1 more source

Packing triangles in low degree graphs and indifference graphs [PDF]

Discrete Mathematics & Theoretical Computer Science, 2005
We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard.
Gordana Manić, Yoshiko Wakabayashi
doaj   +1 more source

Polynomial-Computable Representation of Neural Networks in Semantic Programming

J, 2023
A lot of libraries for neural networks are written for Turing-complete programming languages such as Python, C++, PHP, and Java. However, at the moment, there are no suitable libraries implemented for a p-complete logical programming language L.
Sergey Goncharov, Andrey Nechesov
doaj   +1 more source

Solution of the Problem P = L

Mathematics, 2021
The problems associated with the construction of polynomial complexity computer programs require new techniques and approaches from mathematicians. One of such approaches is representing some class of polynomial algorithms as a certain class of special ...
Sergey Goncharov, Andrey Nechesov
doaj   +1 more source

Special Type Routing Problems in Plane Graphs

Mathematics, 2022
We considered routing problems for plane graphs to solve control problems of cutting machines in the industry. According to the cutting plan, we form its homeomorphic image in the form of a plane graph G.
Tatiana Makarovskikh, Anatoly Panyukov
doaj   +1 more source

Decomposition Algorithms for Tensors and Polynomials

SIAM Journal on Applied Algebra and Geometry, 2023
19 ...
Antonio Laface, Alex Massarenti, Rick Rischter   +2 more
openaire   +3 more sources