Search
Didn't find any results in this catalog!
But we have some results in other catalogs.Filters
total: 7176
-
Catalog
- Publications 5916 available results
- Journals 24 available results
- Conferences 5 available results
- Publishing Houses 1 available results
- People 141 available results
- Inventions 4 available results
- Projects 6 available results
- e-Learning Courses 29 available results
- Events 20 available results
- Open Research Data 1030 available results
displaying 1000 best results Help
Search results for: COST COLORING
-
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 NP-hard and we present an exact polynomial algorithm for the other finite sequences. These results are then extended...
-
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
PublicationW artykule rozważamy listowo-kosztowe kolorowanie wierzchołków i krawędzi grafu w modelu wierzchołkowym, krawędziowym, totalnym i pseudototalnym. Stosujemy programowanie dynamiczne w celu otrzymania algorytmów wielomianowych dla drzew. Następnie uogólniamy to podejście na dowolne grafy z ograniczonymi liczbami cyklomatycznymi i na ich multikolorowania.
-
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
Publication -
Efficient List Cost Coloring of Vertices and∕or Edges of Some Sparse Graphs
Publication -
Efficient list cost coloring of vertices and/or edges of some sparse graphs
PublicationRozważane jest kolorowanie wierzchołków i krawędzi grafów w modelach klasycznym, totalnym i pseudototalnym z uwzględnieniem dodatkowego ograniczenia w postaci list dostępnych kolorów. Proponujemy wielomianowy algorytm oparty na paradygmacie programowania dynamicznego dla grafów o strukturze drzewa. Wynik ten można uogólnić na grafy o liczbie cyklomatycznej ograniczonej z góry przez dowolnie wybraną stała.
-
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 n-vertex 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:...
-
Post-peak behaviour of CFST columns
PublicationArtykuł dotyczy zachowania pokrytycznego słupów CFST. Parametrami zmiennymi w badaniach są: wysokość słupów, grubość stalowego płaszcza, wytrzymałość betonu i stali, przyczepność między stalowym płaszczem a betonowym rdzeniem oraz sposób przykładania obciążenia. W artykule dokonano analizy wpływu tych parametrów na zachowanie pokrytyczne badanych słupów.
-
The selected roof covering technologies in the aspect of their life cycle costs
PublicationIn the article is presented an analysis of the life cycle costs calculation for selected roof coverings. The scope of research includes costs of construction, maintenance and demolition of the roof covering structure for two alternative technologies – the traditional and new generation. On the presented example of an industrial building with a roof area of 1000 m², the above costs are taken to consideration for the roof covering...
-
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 k-partite 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.
-
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...