Search
Filters
total: 25
filtered: 23
Chosen catalog filters
Search results for: EQUITABLE%20CHROMATIC%20NUMBER
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
PublicationIn the paper we consider the problems of equitable and semi-equitable coloring of vertices of cubic graphs. We show that in contrast to the equitable coloring, which is easy, the problem of semi-equitable coloring is NP- complete within a broad spectrum of graph parameters. This affects the complexity of batch scheduling of unit-length jobs with cubic incompatibility graph on three uniform processors to minimize...
-
Equitable coloring of corona multiproducts of graphs
PublicationWe give some results regarding the equitable chromatic number for l-corona product of two graphs: G and H, where G is an equitably 3- or 4-colorable graph and H is an r-partite 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 equitablyk-colorable 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 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...
-
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 NP-complete even if G is 4-regular 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 4-colorable graph and H is an r-partite graph, a path, a cycle or a complete graph.
-
Equitable colorings of some variation of corona products of cubic graphs
PublicationThe problem of determining the value of equitable chromatic number for multicoronas of cubic graphs is studied. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use almost optimal number of colors in the remaining cases.
-
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 NP-hard, we report on practical experiments with some efficient polynomial-time algorithms for approximate equitable coloring of general graphs.
-
Tight bounds on the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationWe consider the complexity of semi-equitable k-coloring, k>3, of the vertices of a cubic or subcubic graph G. In particular, we show that, given a n-vertex subcubic graph G, it is NP-complete to obtain a semi-equitable k-coloring of G whose non-equitable color class is of size s if s>n/3, and it is polynomially solvable if s, n/3.
-
Smartphones as tools for equitable food quality assessment
PublicationBackground: The ubiquity of smartphones equipped with an array of sophisticated sensors, ample processing power, network connectivity and a convenient interface makes them a promising tool for non-invasive, portable food quality assessment. Combined with the recent developments in the areas of IoT, deep learning algorithms and cloud computing, they present an opportunity for advancing wide-spread, equitable and sustainable food...
-
Sharp bounds for the complexity of semi-equitable coloring of cubic and subcubic graphs
PublicationIn this paper we consider the complexity of semi-equitable k-coloring of the vertices of a cubic or subcubic graph. We show that, given n-vertex subcubic graph G, a semi-equitable k-coloring of G is NP-hard if s >= 7n/20 and polynomially solvable if s <= 7n/21, where s is the size of maximum color class of the coloring.
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
Publication -
Green and equitable analytical chemistry
PublicationGreen analytical chemistry introduces the ideas of reduction ofanalytical activities impact on the environment. However, to bemore sustainable, analytical chemistry should include socialaspects in greater manner. In this light‘equitable’analyticalprocedures, which are easily available in terms of price andapplicability by everyday user, are developed. These positivetrends are observed as many procedures, based on commonlyused for...
-
Equitable vertex coloring of graphs
PublicationW pracy podajemy wartości sprawiedliwej liczby chromatycznej dla niektórych klas grafów. Podajemy również dwa algorytmy heurystyczne dla sprawiedliwego kolorowania grafów z suboptymalna liczba koloru.
-
The complexity of equitable vertex coloring graphs
PublicationW artykule podajemy wzory na sprawiedliwą liczbę chromatyczną niektórych produktów grafowych. Ponadto przedstawiamy dwa algorytmy wielomianowe dla sprawiedliwego kolorowania grafów suboptymalną liczba kolorów.
-
Equitable 4-coloring of cacti and edge-cacti in polynomial time
PublicationRozważono problem wyznaczania sprawiedliwej liczby chromatycznej kaktusów i drzew wielokątowych bez trójkątów i krawędzi wiszących. Podano wielomianowy algorytm wyznaczający pokolorowanie optymalne, oparty na paradygmacie programowania dynamicznego. Tym samym znaleziona została kolejna klasa grafów planarnych, dla której kolorowanie sprawiedliwe jawi się jako zagadnienie obliczeniowo łatwe.
-
Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
Publication -
Eqiuitable coloring of corona products of cubic graphs is harder than ordinary coloring
PublicationA graph is equitably k-colorable 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...
-
Sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych
PublicationW pracy rozpatrywane są sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych. Pokazano, że w odróżnieniu od tego pierwszego, który jest łatwy, problem istnienia pokolorowań półsprawiedliwych jest NP-zupełny w szerokim zakresie parametrów grafów.
-
Green, simple analytical method for total biogenic amines content determination in wine using spectrophotometry
PublicationA simple, green and equitable procedure for total biogenic amines (BAs) content determination was developed. The scientific novelty lies in the use of commercially available S 0378 dye, the reaction of which with BAs results in a colour change of the solution. Sample preparation and analysis were simplified to make the method suitable for routine analyses even in resource-scarce settings. The optimization of the method was carried...
-
Selecting wells for an optimal design of groundwater monitoring network based on monitoring priority map: A Kish Island case study
PublicationThis paper presents a novel approach, i.e. a combination of gamma test and monitoring priority map, for optimal design of groundwater monitoring network (GMN) by considering the cumulative effects of industries, human activities, and natural factors on the groundwater quality. The proposed method was successfully applied to design an optimal network for groundwater salinity monitoring on Kish Island, Persian Gulf. The priority...
-
Gender and Digital Divide - Information and Communication Technologiesand their Impact on Equality
PublicationIn the entire Europe more women than men graduate from tertiaryeducation institutes. However, they are underrepresented in scientific and engineering disciplines. Women researchers still constitute a minority in the Government and Higher Education Sectors. A number of industry reports highlight a low number of women in IT occupations49. This has led to a variety of public policy measures, such as subsidies on community provision,...
-
AMO perspectives on the well-being of neurodivergent human capital
PublicationExisting management research and management practices frequently overlook the relationship between the above-average human capital of highly functioning neurodivergent employees, their subjective well-being in the workplace and performance outcomes. This paper calls for greater attention to the hidden human capital associated with neurodiversity by mainstreaming implementation of neurodiversity-friendly policies and practices. Drawing...
-
AMO model for neuro-inclusive remote workplace
PublicationPurpose The aim of this article is to extend current debates on organizational equality, diversity and inclusion to a consideration of neurodivergence in the remote workplace context. Design/methodology/approach Drawing on the ability, motivation, and opportunity (AMO) model and an emerging strength-based approach to neurodiversity, this conceptual paper integrates research on neurodiversity at work and remote working to provide...
-
Building Confidence and Trust in Ireland's National Maternity Services Workforce –What matters most and how?
PublicationNational surveys on care experiences are increasingly adopted as regulatory mechanisms for improving care quality and increasing public trust in healthcare services. Based on data collected as part of Ireland's 2020 National Maternity Experience Survey, this study investigates care-related factors that contribute most to confidence and trust in the professional workforce (or carers) within Irish maternity services. The survey covered...