Search results for: interval incidence coloring

Interval incidence coloring of subcubic graphs
PublicationIn this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4coloring problem is polynomially solvable and the interval incidence 5coloring problem is N Pcomplete, and they asked if χii(G) ≤ 2∆(G) holds for an arbitrary graph G. In this paper, we prove that an interval incidence 6coloring always exists for any subcubic graph G with ∆(G) = 3.

Interval incidence coloring of bipartite graphs
PublicationIn this paper we study the problem of interval incidence coloring of bipartite graphs. We show the upper bound for interval incidence coloring number (χii) for bipartite graphs χii≤2Δ, and we prove that χii=2Δ holds for regular bipartite graphs. We solve this problem for subcubic bipartite graphs, i.e. we fully characterize the subcubic graphs that admit 4, 5 or 6 coloring, and we construct a linear time exact algorithm for subcubic...

Interval incidence graph coloring
PublicationIn this paper we introduce a concept of interval incidence coloring of graphs and survey its general properties including lower and upper bounds on the number of colors. Our main focus is to determine the exact value of the interval incidence coloring number χii for selected classes of graphs, i.e. paths, cycles, stars, wheels, fans, necklaces, complete graphs and complete kpartite graphs. We also study the complexity of the...

Interval EdgeColoring of Graphs
Publication 
Interval edgecoloring of graphs.
PublicationRozdział poświęcony prezentacji modelu zwartego kolorowania krawędziowego grafów i jego znanych własności. Szczególny nacisk położono na opis klas grafów dających się pokolorować zwarcie w czasie wielomianowym. Omówiono także stratność jako miarę niepodatności grafu na kolorowanie zwarte.

On incidence coloring of coloring of complete multipartite and semicubic bipartite graphs
PublicationIn the paper, we show that the incidence chromatic number of a complete kpartite graph is at most ∆+2 (i.e., proving the incidence coloring conjecture for these graphs) and it is equal to ∆+1 if and only if the smallest part has only one vertex.

Interval vertexcoloring of a graph with forbidden colors
Publication 
Interval VertexColoring of a Graph With Forbidden Colors
Publication 
Interval edge coloring of a graph with forbidden colors
Publication 
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
PublicationAn edge coloring of a graph G is called interval edge coloring if for each v ∈ V(G) the set of colors on edges incident to v forms an interval of integers. A graph G is interval colorable if there is an interval coloring of G. For an interval colorable graph G, by the interval chromatic index of G, denoted by χ'_i(G), we mean the smallest number k such that G is interval colorable with k colors. A bipartite graph G is called (α,β)biregular...

NoWait & NoIdle Open Shop Minimum Makespan Scheduling with Bioperational Jobs
PublicationIn the open shop scheduling with bioperational jobs each job consists of two unit operations with a delay between the end of the first operation and the beginning of the second one. Nowait requirement enforces that the delay between operations is equal to 0. Noidle means that there is no idle time on any machine. We model this problem by the interval incidentor (1, 1)coloring (IIR(1, 1)coloring) of a graph with the minimum...

Enhancing Renal Tumor Detection: Leveraging Artificial Neural Networks in Computed Tomography Analysis
PublicationRenal cell carcinoma is one of the most common cancers in Europe, with a total incidence rate of 18.4 cases per 100 000 population. There is currently significant overdiagnosis (11% to 30.9%) at times of planned surgery based on radiological studies. The purpose of this study was to create an artificial neural network (ANN) solution based on computed tomography (CT) images as an additional tool to improve the differentiation of...

Eqiuitable coloring of corona products of cubic graphs is harder than ordinary coloring
PublicationA graph is equitably kcolorable if its vertices can be partitioned into k independent sets in such a way that the number of vertices in any two sets differ by at most one. The smallest k for which such a coloring exists is known as the equitable chromatic number of G. In this paper the problem of determinig the equitable coloring number for coronas of cubic graphs is studied. Although the problem of ordinary coloring of coronas...

Online Pcoloring of graphs
PublicationFor a given induced hereditary property P, a Pcoloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of online Pcoloring algorithms and give the generalizations and extensions of selected results known for online proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...

Dynamic coloring of graphs
PublicationDynamics is an inherent feature of many real life systems so it is natural to define and investigate the properties of models that reflect their dynamic nature. Dynamic graph colorings can be naturally applied in system modeling, e.g. for scheduling threads of parallel programs, time sharing in wireless networks, session scheduling in highspeed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...

2Coloring number revisited
Publication2Coloring number is a parameter, which is often used in the literature to bound the game chromatic number and other related parameters. However, this parameter has not been precisely studied before. In this paper we aim to fill this gap. In particular we show that the approximation of the game chromatic number by the 2coloring number can be very poor for many graphs. Additionally we prove that the 2coloring number may grow...

The law of the Iterated Logarithm for random interval homeomorphisms
PublicationA proof of the law of the iterated logarithm for random homeomorphisms of the interval is given.

Dynamic Ffree Coloring of Graphs
PublicationA problem of graph Ffree coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic Ffree coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...

Equitable coloring of corona multiproducts of graphs
PublicationWe give some results regarding the equitable chromatic number for lcorona product of two graphs: G and H, where G is an equitably 3 or 4colorable graph and H is an rpartite graph, a cycle or a complete graph. Our proofs lead to polynomial algorithms for equitable coloring of such graph products provided that there is given an equitable coloring of G.

Equitable coloring of hypergraphs
PublicationA hypergraph is equitablykcolorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2coloring of hypergraphs is NPcomplete even for 3uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomialtime algorithm to...

The Backbone Coloring Problem for Small Graphs
PublicationIn this paper we investigate the values of the backbone chromatic number, derived from a mathematical model for the problem of minimization of bandwidth in radio networks, for small connected graphs and connected backbones (up to 7 vertices). We study the relationship of this parameter with the structure of the graph and compare the results with the solutions obtained using the classical graph coloring algorithms (LF, IS), modified...

The Backbone Coloring Problem for Bipartite Backbones
PublicationLet G be a simple graph, H be its spanning subgraph and λ≥2 be an integer. By a λ backbone coloring of G with backbone H we mean any function c that assigns positive integers to vertices of G in such a way that c(u)−c(v)≥1 for each edge uv∈E(G) and c(u)−c(v)≥λ for each edge uv∈E(H) . The λ backbone chromatic number BBCλ(G,H) is the smallest integer k such that there exists a λ backbone coloring c of G with backbone H satisfying...

Parallel tabu search for graph coloring problem
PublicationTabu search is a simple, yet powerful metaheuristic based on local search that has been often used to solve combinatorial optimization problems like the graph coloring problem. This paper presents current taxonomy of patallel tabu search algorithms and compares three parallelization techniques applied to Tabucol, a sequential TS algorithm for graph coloring. The experimental results are based on graphs available from the DIMACS...

Optimal backbone coloring of split graphs with matching backbones
PublicationFor a graph G with a given subgraph H, the backbone coloring is defined as the mapping c: V(G) > N+ such that c(u)c(v) >= 2 for each edge uv \in E(H) and c(u)c(v) >= 1 for each edge uv \in E(G). The backbone chromatic number BBC(G;H) is the smallest integer k such that there exists a backbone coloring with max c(V(G)) = k. In this paper, we present the algorithm for the backbone coloring of split graphs with matching backbone.

Chromatic cost coloring of weighted bipartite graphs
PublicationGiven a graph G and a sequence of color costs C, the Cost Coloring optimization problem consists in finding a coloring of G with the smallest total cost with respect to C. We present an analysis of this problem with respect to weighted bipartite graphs. We specify for which finite sequences of color costs the problem is NPhard and we present an exact polynomial algorithm for the other finite sequences. These results are then extended...

Cops, a fast robber and defensive domination on interval graphs
PublicationThe game of Cops and ∞fast Robber is played by two players, one controlling c cops, the other one robber. The players alternate in turns: all the cops move at once to distance at most one each, the robber moves along any copfree path. Cops win by sharing a vertex with the robber, the robber by avoiding capture indefinitely. The game was proposed with bounded robber speed by Fomin et al. in “Pursuing a fast robber on a graph”,...

Minimum order of graphs with given coloring parameters
PublicationA complete kcoloring of a graph G=(V,E) is an assignment F: V > {1,...,k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in a complete coloring (chromatic number χ(G) and achromatic number ψ(G), respectively),...

Parallel immune system for graph coloring
PublicationThis paper presents a parallel artificial immune system designed forgraph coloring. The algorithm is based on the clonal selection principle. Each processor operates on its own pool of antibodies and amigration mechanism is used to allow processors to exchange information. Experimental results show that migration improves the performance of the algorithm. The experiments were performed using a high performance cluster on a set...

Equitable coloring of corona products of graphs
PublicationIn this paper we consider an equitable coloring of some corona products of graphs G and H in symbols, G o H). In particular, we show that deciding the colorability of G o H is NPcomplete even if G is 4regular and H is K_2. Next, we prove exact values or upper bounds on the equitable chromatic number of G o H, where G is an equitably 3 or 4colorable graph and H is an rpartite graph, a path, a cycle or a complete graph.

Sharp bounds for the complexity of semiequitable coloring of cubic and subcubic graphs
PublicationIn this paper we consider the complexity of semiequitable kcoloring of the vertices of a cubic or subcubic graph. We show that, given nvertex subcubic graph G, a semiequitable kcoloring of G is NPhard if s >= 7n/20 and polynomially solvable if s <= 7n/21, where s is the size of maximum color class of the coloring.

Equitable coloring of graphs. Recent theoretical results and new practical algorithms
PublicationIn this paper we survey recent theoretical results concerning conditions for equitable colorability of some graphs and recent theoretical results concerning the complexity of equitable coloring problem. Next, since the general coloring problem is strongly NPhard, we report on practical experiments with some efficient polynomialtime algorithms for approximate equitable coloring of general graphs.

The computational complexity of the backbone coloring problem for boundeddegree graphs with connected backbones
PublicationGiven a graph G, a spanning subgraph H of G and an integer λ>=2, a λbackbone coloring of G with backbone H is a vertex coloring of G using colors 1, 2, ..., in which the color difference between vertices adjacent in H is greater than or equal to lambda. The backbone coloring problem is to find such a coloring with maximum color that does not exceed a given limit k. In this paper, we study the backbone coloring problem for boundeddegree...

Generic invariant measures for iterated systems of interval homeomorphisms
PublicationIt is well known that iterated function systems generated by orientation preserving homeomorphisms of the unit interval with positive Lyapunov exponents at its ends admit a unique invariant measure on (0, 1) provided their action is minimal. With the additional requirement of continuous differentiability of maps on a fixed neighbourhood of {0,1} { 0 , 1 } , we present a metric in the space of such systems which renders it complete....

A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublicationIn 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. We show that the minimum cost coloring problem for nvertex bipartite graph of degree ∆≤4 can be solved in O(n^2) time. This extends Jansen’s result [K.Jansen,The optimum cost chromatic partition problem, in:...

Examination method of the effect of the incidence angle of laser beam on distance measurement accuracy to surfaces with different colour and roughness
PublicationInterest in the influence of the incidence angle of a laser beam to distance measurements can be seen in many areas of science and technology: geodesy, glaciology, archaeology, machine automation, and others. This paper presents results of measurements of the effect of the incidence angle of a laser beam to distance measurements to the surfaces of different colour and roughness by Topcon's electrooptical total station with an...

Equitable and semiequitable coloring of cubic graphs and its application in batch scheduling
PublicationIn the paper we consider the problems of equitable and semiequitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semiequitable coloring is NP complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unitlength jobs with cubic incompatibility graph on three uniform processors to minimize...

Innovations in Incidence Geometry
Journals 
Tight bounds on the complexity of semiequitable coloring of cubic and subcubic graphs
PublicationWe consider the complexity of semiequitable kcoloring, k>3, of the vertices of a cubic or subcubic graph G. In particular, we show that, given a nvertex subcubic graph G, it is NPcomplete to obtain a semiequitable kcoloring of G whose nonequitable color class is of size s if s>n/3, and it is polynomially solvable if s, n/3.

Determinants of the incidence of nonacademic staff in European and US HEIs
PublicationIn this article, we contribute to the scant literature covering quantitative studies on the determinants of the nonacademic staff incidence in higher education institutions by analysing how the proportion of nonacademic staff is related to key features such as size, prestige, year of foundation and financial structure of universities. We apply nonlinear regression analysis to compare HEIs across Europe and the USA, taking into...

A method of Functional Test interval selection with regards to Machinery and Economical aspects
PublicationThis paper discusses the problem of choosing the optimal frequency of functional test, including the reliability calculations and production efficiency, but also the effect of company risk management. The proof test as a part of the functional test interval is well described for the process industry. Unfortunately, this situation is not the case for the machinery safety functions with low demand mode. Afterwards, it is presented...

Monitoring of Chlorine Concentration in Drinking Water Distribution Systems Using an Interval Estimator
PublicationThis paper describes the design of an interval observer for the estimation of unmeasured quality state variables in drinking water distribution systems. The estimator utilizes a set bounded model of uncertainty to produce robust interval bounds on the estimated state variables of the water quality. The bounds are generated by solving two differential equations. Hence the numerical efficiency is sufficient for online monitoring...

A Novel Approach to the Assessment of Cough Incidence
PublicationIn this paper we consider the problem of identication of cough events in patients suffering from chronic respiratory diseases. The information about frequency of cough events is necessary to medical treatment. The proposed approach is based on bidirectional processing of a measured vibration signal  cough events are localized by combining the results of forwardtime and backwardtime analysis. The signal is at rst transformed...

The Method of Selecting the Interval of Functional Tests Taking into Account Economic Aspects and Legal Requirements
PublicationThe article discusses the problem of choosing the optimal frequency of functional tests, taking into account the reliability and law requirements, but also the impact of business aspects in the company. The subject of functional test interval is well described for purposes of the process industry. Unfortunately, this is not the case for the machinery safety functions with low demand mode. This is followed by a presentation of the...

The computational complexity of the backbone coloring problem for planar graphs with connected backbones
PublicationIn the paper we study the computational complexity of the backbone coloring problem for planar graphs with connected backbones. For every possible value of integer parameters λ≥2 and k≥1 we show that the following problem: Instance: A simple planar graph GG, its connected spanning subgraph (backbone) HH. Question: Is there a λbackbone coloring c of G with backbone H such that maxc(V(G))≤k? is either NPcomplete or polynomially...

Computer experiments with a parallel clonal selection algorithm for the graph coloring problem
PublicationArtificial immune systems (AIS) are algorithms that are based on the structure and mechanisms of the vertebrate immune system. Clonal selection is a process that allows lymphocytes to launch a quick response to known pathogens and to adapt to new, previously unencountered ones. This paper presents a parallel island model algorithm based on the clonal selection principles for solving the Graph Coloring Problem. The performance of...

An interval estimator for chlorine monitoring in drinking water distribution systems under uncertain system dynamics, inputs and chlorine concentration measurement errors
PublicationThe design of an interval observer for estimation of unmeasured state variables with application to drinking water distribution systems is described. In particular, the design process of such an observer is considered for estimation of the water quality described by the concentration of free chlorine. The interval observer is derived to produce the robust interval bounds on the estimated water quality state variables. The stability...

Tcoloring of graphs.
PublicationNiniejszy rozdział omawia kontrastowe kolorowanie grafów. Podana została jego definicja i podstawowe własności, zastosowania oraz złożoność obliczeniowa problemów rozważanych w ramach tej dziedziny.

Rank Coloring of Graphs.
PublicationRozdział jest poświęcony uporządkowanemu kolorowaniu grafów. Przedstawiono jego podstawowe własności oraz zastosowania praktyczne.

Harmonions Coloring of Graphs.
PublicationProblem kolorowania grafów jest motywowany radionawigacją lotniczą, kompresją obrazów i in. W rozdziale podano podstawowe fakty dotyczące tego modelu kolorowania, a wsród nich dolne i górne oszacowania na liczbę harmoniczną i algorytm o złożoności 0 (mm3) dający bardzo dobre pokolorowania przybliżone.

Classical coloring of graphs.
PublicationRozdział obejmuje klasyczne kolorowanie krawędzi i wierzołków w grafach prostych. Oprócz podstawowych definicji podane zostały najczęściej stosowane metody przybliżone oraz ich właściwości. Dodatkowo rozdział zawiera przegląd znanych benczmarków dla podanych metod w kontekście klasycznego modelu kolorowania.