wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: COVERING DIMENSION
-
Parallel immune system for graph coloring
PublikacjaThis 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...
-
On greedy graph coloring in the distributed model
PublikacjaArtykuł traktuje o zachłannym kolorowaniu grafów w modelu rozproszonym. Zaprezentowano nowy probabilistyczny algorytm dający w wyniku pokolorowanie LF. Udowodniono, że jakakolwiek rozproszona implementacja LF wymaga co najmniej D rund, gdzie D jest maksymalnym stopniem wierzchołka w grafie.
-
Equitable coloring of corona products of graphs
PublikacjaIn 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.
-
The Backbone Coloring Problem for Bipartite Backbones
PublikacjaLet 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...
-
Interval incidence coloring of subcubic graphs
PublikacjaIn this paper we study the problem of interval incidence coloring of subcubic graphs. In [14] the authors proved that the interval incidence 4-coloring problem is polynomially solvable and the interval incidence 5-coloring problem is N P-complete, and they asked if χii(G) ≤ 2∆(G) holds for an arbitrary graph G. In this paper, we prove that an interval incidence 6-coloring always exists for any subcubic graph G with ∆(G) = 3.
-
Equitable coloring of corona multiproducts of graphs
PublikacjaWe 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.
-
Interval incidence coloring of bipartite graphs
PublikacjaIn 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...
-
The Backbone Coloring Problem for Small Graphs
PublikacjaIn 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...
-
Modelling of pipes conveying flowing liquid
PublikacjaThe paper introduces the method of modal reduction of system which consists of pipe with flowing liquid. The concept of hybrid model is proposed. The system model consists of two parts, the modal model and the finite elements model. The modal model represents linear, self-adjoined part of the system, while simple lumped technique is applied for modelling of Coriolis phenomena.
-
Edge-coloring of 3-uniform hypergraphs
PublikacjaWe consider edge-colorings of 3-uniform hypergraphs which is a natural generalization of the problem of edge-colorings of graphs. Various classes of hypergraphs are discussed and we make some initial steps to establish the border between polynomial and NP-complete cases. Unfortunately, the problem appears to be computationally difficult even for relatively simple classes of hypergraphs.
-
Dimensioni e problemi della ricerca storica
Czasopisma -
GLOBAL ENVIRONMENTAL CHANGE-HUMAN AND POLICY DIMENSIONS
Czasopisma -
EFFECT OF PRESS DRYING ON DIMENSION STABILITY AND DENSITY OF BEECH WOOD,
PublikacjaTimber is traditionally dried in kilns by processes that often take several days or weeks to complete. At present, it is possible to apply several methods of rapid drying of timber, including, for example, press drying. This research is based on the use of this process. Drying was performed using the heating plates with a temperature of 160 °C. Three pressures were compared in the research 1.0 MPa, 1.4 MPa, and 1.8 MPa. The density...
-
Axiological Dimension of Consumption in the Context of Sustainable Development and Environmental Ethics
PublikacjaPodjęta próba odpowidzi na pytanie, w jaki sposób krytyka konsumpcjonizmu i modelowanie wzorów eko-konsumpcji odwołują się do koncepcji zrownoważonego rozwoju i etyki środowiskowej.Przedstawiona argumentacja na rzecz tezy, że holistycznie ujęty zrownoważony rozwoj oraz wyzwania na rzecz cywilizacyjnej zmiany w kierunku paradygmatu ekologizmu mogą być zrealizowane poprzez przesunięcie ontologiczne...
-
Fixed point indices of iterated smooth maps in arbitrary dimension
PublikacjaWe give a complete description of possible sequences ofindices of iterations of f at an isolated fixed point, answering inaffirmative the Chow, Mallet-Paret and Yorke conjecture posed in[S.N. Chow, J. Mallet-Parret, J.A. Yorke, A periodic point index whichis a bifurcation invariant, in: Geometric Dynamics, Rio de Janeiro,1981, in: Lecture Notes in Math., vol. 1007, Springer, Berlin, 1983,pp. 109-131].
-
Metropolitan dimension of Tri-City: Development of the new harbor structures
PublikacjaThis article deals with the phenomenon of urban waterfront transformation. The special focus is on the Tri-City area in Poland. Both the transformation of port structures and redevelopment of the post-harbor areas are presented.
-
The culture of excellence and its dimensions in higher education
PublikacjaPurpose To recognize the existing state of knowledge on a culture of excellence (CoE) in higher education institutions (HEIs) and to define the CoE in HEI and the dimensions that make up that culture. A subsidiary goal is to propose a qualitative tool to measure CoE maturity. Design/methodology/approach The study was based on the qualitative method, the preferred reporting system of systematic reviews and meta-analysis (PRISMA)....
-
Managing Virtual Teams: The Three Dimensions Scope
PublikacjaDue to globalisation and economic reasons the number of people working as a team in a virtual environment is increasing. Although virtual team can outperform teams working in a traditional environment still many managers face difficulties in achieving this goal. This article describes the idea of a system that would support knowledge management in virtual teams focusing on three dimensions of virtual work: location, organisation,...
-
Visual Dimensions of Modeling Languages in Interdisciplinary Perspective
PublikacjaUżyteczność języków modelowania wizualnego zależy od notacji. Notacja może być postrzegana jako zestaw wizualnych komponentów, które w określony sposób oddziałują na ludzkie oko i ludzki mózg. Referat przedstawia analizę interdyscyplinarną wykonaną w celu lepszego zrozumienia wizualnych wymiarów języków modelowania. Wizualne wymiary pochodzą z teorii opisujących percepcję wzrokową, wizualizację danych oraz reprezentacje poznawcze....
-
Sum Coloring of Bipartite Graphs with Bounded Degree
Publikacja -
A better practical algorithm for distributed graph coloring
Publikacja -
Interval vertex-coloring of a graph with forbidden colors
Publikacja -
Interval Vertex-Coloring of a Graph With Forbidden Colors
Publikacja -
Interval edge coloring of a graph with forbidden colors
Publikacja -
Parallel tabu search for graph coloring problem
PublikacjaTabu search is a simple, yet powerful meta-heuristic 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...
-
Pure silicon recovering from photovoltaic modules
PublikacjaOdzyskiwanie krzemu ze zużytych lub uszkodzonych modułów fotowoltaicznych może mieć znaczenie nie tylko ekonomiczne, ale również ekologiczne. Etap obejmujący procesy chemiczne wymaga optymalizacji z punktu widzenia wymaganej czystości odzyskiwanego krzemu. W pracy przedstawiono wyniki przeprowadzonych prób trawienia poszczególnych warstw ogniw PV: warstwy antyodblaskowej, metalizacji (kontaktów), złącza p-n. Skład roztworów trawiących...
-
Distributed largest-first algorithm for graph coloring.
PublikacjaW artykule zaprezentowano rozproszony, probabilistyczny algorytm kolorowania grafów. Kolorowanie uzyskane jest optymalne lub prawie optymalne dla takich klas grafów jak koła dwudzielne, gąsienice czy korony. Udowodniono, że algorytm ten działa w czasie O(D^2 log n) rund dla dowolnego grafu n wierzchołkowegoo stopniu maksymalnym D.
-
Sum coloring of bipartite graphs with bounded degree.
PublikacjaArtykuł poświęcony jest złożoności obliczeniowej zagadnienia sumacyjnego kolorowania grafów dwudzielnych o ograniczonym stopniu. Zawiera dowód tego, że sumacyjne kolorowanie grafów dwudzielnych stopnia mniejszego równego 5 jest NP-zupełne oraz opis wielomianowego algorytmu, który optymalnie sumacyjnie koloruje grafy dwudzielne podkubiczne.
-
An experimental study of distributed algorithms for graph coloring.
PublikacjaW pracy podano algorytm rozproszonego kolorowania grafówi porównano ze znanym wcześniej algorytmem.
-
Self-stabilizing algorithm for edge-coloring of graphs
PublikacjaReferat ten poświęcony jest kolorowaniu grafów w modelu rozproszonym.Podano samostabilizujący się algorytm kolorowania krawędzi grafu wraz z dowodem poprawności oraz oszacowaniem jego czasu działania.
-
Chromatic cost coloring of weighted bipartite graphs
PublikacjaGiven 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 NP-hard and we present an exact polynomial algorithm for the other finite sequences. These results are then extended...
-
New potential functions for greedy independence and coloring
PublikacjaA potential function $f_G$ of a finite, simple and undirected graph $G=(V,E)$ is an arbitrary function $f_G : V(G) \rightarrow \mathbb{N}_0$ that assigns a nonnegative integer to every vertex of a graph $G$. In this paper we define the iterative process of computing the step potential function $q_G$ such that $q_G(v)\leq d_G(v)$ for all $v\in V(G)$. We use this function in the development of new Caro-Wei-type and Brooks-type...
-
Minimum order of graphs with given coloring parameters
PublikacjaA complete k-coloring 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),...
-
Optimal edge-coloring with edge rate constraints
PublikacjaWe consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that several questions about the length of the sequence are computationally intractable....
-
Sensivity of echo envelope fractal dimension to bottom type and bottom depth.
PublikacjaPrzedstawiono wynik badania zależności pomiędzy wymiarem fraktalnym obwiedni echa akustycznego od dna a rodzajem dna na wpływ głębokości dna na tę zależność. Wykorzystano sygnały ech otrzymane w wyniku numerycznych symulacji rozpraszania na granicy woda dno dla różnych głębokości dna.
-
Rapid dimension scaling of compact microwave couplers with power split correction
PublikacjaIn this paper, a technique for rapid re-design ofcompact microwave couplers with respect to operating frequency is discussed. Our methodology involves an inverse surrogate model setup using several reference designs optimized (at the level of equivalent circuit representation of the coupler) for a set of operating frequencies within a range of interest. The surrogate establishes the relationship between the operating frequency...
-
Rapid EM-driven antenna dimension scaling through inverse modeling
PublikacjaIn this letter, a computationally feasible technique for dimension scaling of antenna structures is introduced. The proposed methodology is based on inverse surrogate modeling where the geometry parameters of the antenna structure of interest are explicitly related to the operating frequency. The surrogate model is identified based on a few antenna designs optimized for selected reference frequencies. For the sake of computational...
-
A concept of zero-dimensional and three-dimensional thermodynamic modelling of steam storage in a steam cycle
PublikacjaThis work presents the thermodynamic model of steam storage in a steam cycle. The innovative steam storage is an integral part of the unit and thus responds quickly to changes in load. This enhances the primary control reserve while maintaining high efficiency of energy conversion. With regard to power plants, it improves the operational safety of generation units, as it prevents boiler and turbines overload in the case of steep...
-
Dimensional accuracy as the optimization criterion
PublikacjaW pracy zaproponowano nową formułę określania kosztów konstrukcji stalowej. Sformułowano nieliniowe zadanie optymalizacyjne minimalizacji kosztów koordynacyjnych wymiarów montażowych. Przedstawiono transformację problemu w zagadnienie dyskretne oraz zaproponowano rozwiązanie zadania metodami kombinatoryki.
-
PHYSICA E-LOW-DIMENSIONAL SYSTEMS & NANOSTRUCTURES
Czasopisma -
The role of time perspectives and impulsivity dimensions in coping styles
PublikacjaBoth time perspectives and impulsivity dimensions are groups of traits that are connected to self-control abilities and might be important for coping styles. However, to date, no study has systematically investigated their utility in predicting coping styles with regard to their multidimensional nature. The current study was correlational and exploratory, aiming to discover what amount of variance in each of the three coping...
-
Globalisation and world economic poverty: The significance of hidden dimensions
PublikacjaThe aim of our research is to examine how individual dimensions of globalization affect economic poverty in the World. for this, regression models are estimated with FGT0 or FGT1 poverty measures as dependent variables and KOF indices of globalization as despendent variables. The poverty indices are estimated for 119 countries' income didtributions assuming log-normality and using Gini estimates from the WID2 database and GDP/capita...
-
Numerical Solution of the Two-Dimensional Richards Equation Using Alternate Splitting Methods for Dimensional Decomposition
PublikacjaResearch on seepage flow in the vadose zone has largely been driven by engineering and environmental problems affecting many fields of geotechnics, hydrology, and agricultural science. Mathematical modeling of the subsurface flow under unsaturated conditions is an essential part of water resource management and planning. In order to determine such subsurface flow, the two-dimensional (2D) Richards equation can be used. However,...
-
The complexity of the T-coloring problem for graphs with small degree
Publikacja -
Some results on a trading model in a consensus list coloring
Publikacja -
A linear time algorithm for edge coloring of binomial trees
Publikacja -
Some results on trading model in a consensus list coloring
PublikacjaKonsensusowy model kolorowania grafów - uogólnienie kolorowania listowego, został zdefiniowany przez Mahadeva i Robertsa w 2002 jako użyteczne narzędzie teoretyczne w niektórych zagadnieniach bioinformatycznych. Pozostaje on jednak słabo rozpoznany pod względem własności algorytmicznych. Wykazujemy, że problem kolorowania grafów pełnych w tym modelu jest wielomianowy, co można uogólnić na częściowe k-drzewa przy ustalonym ograniczeniu...
-
On the complexity of distributed graph coloring with local minimality constraints
PublikacjaArtykuł traktuje o zachłannym kolorowaniu grafów w modelu rozproszonym. Omówiono algorytmy rozproszone, dające w wyniku pokolorowanie spełniające warunki dla pokolorowań sekwencyjnych typu S oraz Largest-First (LF). Udowodniono również, że każda rozproszona implementacja algorytmu S wymaga co najmniej Omega(log n / log log n) rund, a algorytmu LF co najmniej Omega (n^{1/2}) rund, gdzie n oznacza liczbę wierzchołków grafu.
-
The complexity of the T-coloring problem for graphs with small degree.
PublikacjaW pracy ustalono złożoność obliczeniową problemu optymalnego kolorowania grafów o ustalonym stopniu.
-
Edge coloring of graphs of signed class 1 and 2
PublikacjaRecently, Behr (2020) introduced a notion of the chromatic index of signed graphs and proved that for every signed graph (G, σ) it holds that ∆(G) ≤ χ′(G,σ) ≤ ∆(G) + 1, where ∆(G) is the maximum degree of G and χ′ denotes its chromatic index. In general, the chromatic index of (G, σ) depends on both the underlying graph G and the signature σ. In the paper we study graphs G for which χ′(G, σ) does not depend on σ. To this aim we...