Search results for: EXCITABLE SYSTEMS

• CYBERNETICS AND SYSTEMS

  Journals

  ISSN: 0196-9722 , eISSN: 1087-6553

• Equitable coloring of hypergraphs

  Publication

  • H. Furmańczyk
  • P. Obszarski

  - DISCRETE APPLIED MATHEMATICS - Year 2019

  A 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...

  Full text available to download

• TELECOMMUNICATION SYSTEMS

  Journals

  ISSN: 1018-4864 , eISSN: 1572-9451

• Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling

  Publication

  • H. Furmańczyk
  • M. Kubale

  - Archives of Control Sciences - Year 2015

  Full text to download in external service

• Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling

  Publication

  • H. Furmańczyk
  • M. Kubale

  - Archives of Control Sciences - Year 2015

  In 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...

  Full text available to download

• Equitable vertex coloring of graphs

  Publication

  • H. Furmańczyk
  • M. Kubale

  - Year 2005

  W 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.

• Green and equitable analytical chemistry

  Publication

  • R. Marcinkowska
  • J. Namieśnik
  • M. Tobiszewski

  - Current Opinion in Green and Sustainable Chemistry - Year 2019

  Green 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...

  Full text to download in external service

• Zdzisław Kowalczuk prof. dr hab. inż.

  People

  Department of Decision Systems and Robotics

  Zdzislaw Kowalczuk received his M.Sc. degree in 1978 and Ph.D. degree in 1986, both in Automatic Control from Technical University of Gdańsk (TUG), Gdańsk, Poland. In 1993 he received his D.Sc. degree (Dr Habilitus) in Automatic Control from Silesian Technical University, Gliwice, Poland, and the title of Professor from the President of Poland in 2003. Since 1978 he has been with Faculty of Electronics, Telecommunications and Informatics...

• A system automating repairs of IT systems

  Publication

  • M. Kamiński

  - Elektronika : konstrukcje, technologie, zastosowania - Year 2009

  This paper presents two problems that are important nowadays: the problem of IT systems monitoring and the problem of repairing them. It shows the developed solution, aimed to automate the existing industrial repair process and to integrate it with the existing monitoring solutions and mechanisms. Described solution is a part of a bigger whole, called the Repair Management Framework (RMF). This paper presents also briefly a case...

  Full text to download in external service

• The complexity of equitable vertex coloring graphs

  Publication

  • H. Furmańczyk
  • M. Kubale

  - Year 2005

  W 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.