Search
Search results for: 3-UNIFORM HYPERGRAPH,SCHEDULING,EDGE-COLORING
-
Edge-coloring of 3-uniform hypergraphs
PublicationWe 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.
-
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...
-
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...
-
Better polynomial algorithms for scheduling unit-length jobs with bipartite incompatibility graphs on uniform machines
PublicationThe goal of this paper is to explore and to provide tools for the investigation of the problems of unit-length scheduling of incompatible jobs on uniform machines. We present two new algorithms that are a significant improvement over the known algorithms. The first one is Algorithm 2 which is 2-approximate for the problem Qm|p j = 1, G = bisubquartic|Cmax . The second one is Algorithm 3 which is 4-approximate for the problem Qm|p...
-
Scheduling on Uniform and Unrelated Machines with Bipartite Incompatibility Graphs
PublicationThe problem of scheduling jobs on parallel machines under an incompatibility relation is considered in this paper. In this model, a binary relation between jobs is given and no two jobs that are in the relation can be scheduled on the same machine. We consider job scheduling under the incompatibility relation modeled by a bipartite graph, under the makespan optimality criterion, on uniform and unrelated machines. Unrelated machines...
-
Optimal edge-coloring with edge rate constraints
PublicationWe 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....
-
Heuristic scheduling algorithms for uniform load of computer system
PublicationW pracy zaprezentowano opracowany heurystyczny algorytm szeregowania zadań UNILO (ang. UNIform LOad - jednakowe obciążenie), umożliwiający redukcję całkowitego zapotrzebowania na moc obliczeniową systemu komputerowego bez pogarszania jego wydajności. Algorytm ten realizuje takie przydzielenie zadań obliczeniowych do poszczególnych jednostek (procesorów), aby zapewnić ich jednakowe obciążenie. Opracowany algorytm został zweryfikowany...
-
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
PublicationWe consider the problem of scheduling n identical jobs on 3 uniform machines with speeds s1, s2, and s3 to minimize the schedule length. We assume that jobs are subject to some kind of mutual exclusion constraints, modeled by a cubic incompatibility graph. We how that if the graph is 2-chromatic then the problem can be solved in O(n^2) time. If the graph is 3-chromatic, the problem becomes NP-hard even if s1>s2=s3.
-
Scheduling of identical jobs with bipartite incompatibility graphs on uniform machines. Computational experiments
PublicationWe consider the problem of scheduling unit-length jobs on three or four uniform parallel machines to minimize the schedule length or total completion time. We assume that the jobs are subject to some types of mutual exclusion constraints, modeled by a bipartite graph of a bounded degree. The edges of the graph correspond to the pairs of jobs that cannot be processed on the same machine. Although the problem is generally NP-hard,...
-
Scheduling of unit-length jobs with bipartite incompatibility graphs on four uniform machines
PublicationThe problem of scheduling n identical jobs on 4 uniform machines with speeds s1>=s2>=s3>=s4 is considered.The aim is to find a schedule with minimum possible length. We assume that jobs are subject to mutual exclusion constraints modeled by a bipartite incompatibility graph of degree delta. We show that the general problem is NP-hard even if s1=s2=s3. If, however, delta<5 and s1>12s2 s2=s3=s4, then the problem can be solved to...
-
Interval Edge-Coloring of Graphs
Publication -
Mixed graph edge coloring
PublicationW pracy rozważany jest problem kolorowania krawędzi grafu mieszanego, tj. grafu zawierającego zawiero skierowane, jak i nieskierowane krawędzie. Motywację do badań stanowią zagadnienia komunikacyjne z zakresu szeregowania zadań.
-
Interval edge-coloring 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.
-
Interval edge coloring of a graph with forbidden colors
Publication -
Self-stabilizing algorithm for edge-coloring of graphs
PublicationReferat 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.
-
A linear time algorithm for edge coloring of binomial trees
Publication -
Edge coloring of graphs of signed class 1 and 2
PublicationRecently, 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...
-
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.
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km;n), 2<m<7, 1<n<R(3,m)
Open Research DataFor K3 and Km graphs, a coloring type (K3,Km;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km subgraph in the second color (representing by edges in the graph).The Ramsey number R(3,m) is the smallest natural number n such that for any edge coloring...
-
Scheduling with precedence constraints: mixed graph coloring in series-parallel graphs.
PublicationW pracy rozważono problem kolorowania grafów mieszanych, opisujący zagadnienie szeregowania zadań, w którym zależności czasowe zadań mają charakter częściowego porządku lub wzajemnego wykluczania. Dla przypadku, w którym graf zależności jest szeregowo-równoległy, podano algorytm rozwiązujący problem optymalnie w czasie $O(n^3.376 * log n)$.
-
Equitable and semi-equitable coloring of cubic graphs and its application in batch scheduling
Publication -
A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
PublicationWe address a generalization of the classical 1- and 2-processor unit execution time scheduling problem on dedicated machines. In our chromatic model of scheduling machines have non-simultaneous availability times and tasks have arbitrary release times and due dates. Also, the versatility of our approach makes it possible to generalize all known classical criteria of optimality. Under these stipulations we show that the problem...
-
Approximating the maximum 2- and 3-edge-colorable subgraph problems
PublicationDla ustalonej wartości parametru k>=2, problem maksymalnego podgrafu krawędziowo k-kolorowalnego polega na wskazaniu k rozłącznych skojarzeń w grafie prostym, a kryterium optymalizacji jest maksymalizacja całkowitej liczby użytych krawędzi. W pracy podano algorytmy 5/6- i 4/5-przybliżone odpowiednio dla przypadków k=2 i k=3, poprawiając wyniki znane z literatury.
-
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...
-
No-Wait & No-Idle 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. No-wait requirement enforces that the delay between operations is equal to 0. No-idle 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...
-
Independence in uniform linear triangle-free hypergraphs
PublicationThe independence number a(H) of a hypergraph H is the maximum cardinality of a set of vertices of H that does not contain an edge of H. Generalizing Shearer’s classical lower bound on the independence number of triangle-free graphs Shearer (1991), and considerably improving recent results of Li and Zang (2006) and Chishti et al. (2014), we show a new lower bound for a(H) for an r-uniform linear triangle-free hypergraph H with r>=2.
-
Dataset of non-isomorphic graphs being coloring types (K3-e,Km-e;n), 2<m<8, 1<n<R(K3-e,Km-e)
Open Research DataFor K3-e and Km-e graphs, the type coloring (K3-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K4-e,Km-e;n), 2<m<7, 1<n<R(K4-e,Km-e)
Open Research DataFor K4-e and Km-e graphs, the type coloring (K4-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K5-e,Km-e;n), 2<m<5, 1<n<R(K5-e,Km-e)
Open Research DataFor K5-e and Km-e graphs, the type coloring (K5-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K5-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K5-e,Km-e) is the smallest...
-
Dataset of non-isomorphic graphs being coloring types (K6-e,Km-e;n), 2<m<5, 1<n<R(K6-e,Km-e)
Open Research DataFor K6-e and Km-e graphs, the type coloring (K6-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K6-e subgraph in the first color (no edge in the graph) or the Km-e subgraph in the second color (exists edge in the graph). Km-e means the full Km graph with one edge removed. The Ramsey number R(K6-e,Km-e) is the smallest...
-
Towards the boundary between easy and hard control problems in multicast Clos networks
PublicationIn this article we study 3-stage Clos networks with multicast calls in general and 2-cast calls, in particular. We investigate various sizes of input and output switches and discuss some routing problems involved in blocking states. To express our results in a formal way we introduce a model of hypergraph edge-coloring. A new class of bipartite hypergraphs corresponding to Clos networks is studied. We identify some polynomially...
-
Dataset of non-isomorphic graphs of the coloring types (K3,Km-e;n), 2<m<7, 1<n<R(K3,Km-e).
Open Research DataFor K3 and Km-e graphs, a coloring type (K3,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K3,Km-e)...
-
Dataset of non-isomorphic graphs of the coloring types (K4,K4;n), 1<n<R(4,4)
Open Research DataFor K4 graph, a coloring type (K4,K4;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the K4 subgraph in the second color (representing by edges in the graph).The Ramsey number R(4,4) is the smallest natural number n such that for any edge coloring of...
-
Dataset of non-isomorphic graphs of the coloring types (K4,Km-e;n), 2<m<5, 1<n<R(K4,Km-e)
Open Research DataFor K4 and Km-e graphs, a coloring type (K4,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4 subgraph in the first color (representing by no edges in the graph) or the Km-e subgraph in the second color (representing by edges in the graph). Km-e means the full Km graph with one edge removed.The Ramsey number R(K4,Km-e)...
-
Dataset of non-isomorphic graphs of the coloring types (Km,K3-e;n), 4<m<8, 1<n<R(Km,K3-e)
Open Research DataFor Km and K3-e graphs, a coloring type (Km,K3-e;n) is such an edge coloring of the full Kn graph, which does not have the Km subgraph in the first color (representing by no edges in the graph) or the K3-e subgraph in the second color (representing by edges in the graph). K3-e means the full Km graph with one edge removed.The Ramsey number R(Km,K3-e)...
-
A bound on the number of middle-stage crossbars in f-cast rearrangeable Clos networks
PublicationIn 2006 Chen and Hwang gave a necessary and sufficient condition under which a three-stage Clos network is rearrangeable for broadcast connections. Assuming that only crossbars of the first stage have no fan-out property, we give similar conditions for f-cast Clos networks, where f is an arbitrary but fixed invariant of the network. Such assumptions are valid for some practical switching systems, e.g. high-speed crossconnects....
-
Scheduling of compatible jobs on parallel machines
PublicationThe dissertation discusses the problems of scheduling compatible jobs on parallel machines. Some jobs are incompatible, which is modeled as a binary relation on the set of jobs; the relation is often modeled by an incompatibility graph. We consider two models of machines. The first model, more emphasized in the thesis, is a classical model of scheduling, where each machine does one job at time. The second one is a model of p-batching...
-
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.
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines: Complexity and Algorithms
PublicationIn this paper, the problem of scheduling on parallel machines with a presence of incompatibilities between jobs is considered. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. The paper provides several results concerning schedules, optimal or approximate with respect to the two most popular criteria of optimality:...
-
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 high-speed LAN's, channel assignment in WDM optical networks as well as traffic scheduling. In...
-
Approximation algorithms for job scheduling with block-type conflict graphs
PublicationThe problem of scheduling jobs on parallel machines (identical, uniform, or unrelated), under incompatibility relation modeled as a block graph, under the makespan optimality criterion, is considered in this paper. No two jobs that are in the relation (equivalently in the same block) may be scheduled on the same machine in this model. The presented model stems from a well-established line of research combining scheduling theory...
-
Rearrangeability in multicast Clos networks is NP-complete
PublicationPrzestrajalność w polach Closa z połączeniami jeden do jeden jest problemem wielomianowym. W pracy pokazano, że w polach z połączeniami jeden do wiele problem ten jest NP zupełny.Three-stage elos networks are commutation networks with circuit switching. So far, graph theory has been very useful tool for solving issues related to these networks with unicast connections. This is so because if elos network is represented as a bipartite...
-
Marek Kubale prof. dr hab. inż.
PeopleDetails concerning: Qualifications, Experiences, Editorial boards, Ph.D. theses supervised, Books, and Recent articles can be found at http://eti.pg.edu.pl/katedra-algorytmow-i-modelowania-systemow/Marek_KubaleGoogle ScholarSylwetka prof. Marka Kubalego Prof. Marek Kubale pracuje na Wydziale ETI Politechniki Gdańskiej nieprzerwanie od roku 1969. W tym czasie napisał ponad 150 prac naukowych, w tym ponad 40 z listy JCR. Ponadto...
-
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...
-
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 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.
-
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.
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines
PublicationIn this paper we consider a problem of job scheduling on parallel machines with a presence of incompatibilities between jobs. The incompatibility relation can be modeled as a complete multipartite graph in which each edge denotes a pair of jobs that cannot be scheduled on the same machine. Our research stems from the works of Bodlaender, Jansen, and Woeginger (1994) and Bodlaender and Jansen (1993). In particular, we pursue the...
-
Minimum order of graphs with given coloring parameters
PublicationA 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),...
-
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.
-
Dynamic F-free Coloring of Graphs
PublicationA problem of graph F-free 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 F-free 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...
-
Bounds on the vertex-edge domination number of a tree
PublicationA vertex-edge dominating set of a graph $G$ is a set $D$ of vertices of $G$ such that every edge of $G$ is incident with a vertex of $D$ or a vertex adjacent to a vertex of $D$. The vertex-edge domination number of a graph $G$, denoted by $\gamma_{ve}(T)$, is the minimum cardinality of a vertex-edge dominating set of $G$. We prove that for every tree $T$ of order $n \ge 3$ with $l$ leaves and $s$ support vertices we have $(n-l-s+3)/4...
-
Karolina Lademann mgr
PeopleCurriculum vitae
-
Mieczysław Brdyś prof. dr hab. inż.
People -
Tomasz Wąsowicz dr hab.
PeopleTomasz Wąsowicz's research was first related to high-resolution atomic spectroscopy and focused on measurements and analysis of the transition probabilities of the forbidden lines, the hyperfine and isotopic structure of spectral lines of heavy elements, Stark effect in the helium atom. Tomasz Wąsowicz currently studies physicochemical processes occurring during interactions of various forms of radiation with atoms and molecules...
-
Computational aspects of greedy partitioning of graphs
PublicationIn this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...
-
T-colorings, divisibility and circular chromatic number
PublicationLet T be a T-set, i.e., a finite set of nonnegative integers satisfying 0 ∈ T, and G be a graph. In the paper we study relations between the T-edge spans espT (G) and espd⊙T (G), where d is a positive integer and d ⊙ T = {0 ≤ t ≤ d (max T + 1): d |t ⇒ t/d ∈ T} . We show that espd⊙T (G) = d espT (G) − r, where r, 0 ≤ r ≤ d − 1, is an integer that depends on T and G. Next we focus on the case T = {0} and show that espd⊙{0} (G) =...
-
Energy efficient indoor localisation for narrowband internet of things
PublicationThere are an increasing number of Narrow Band IoT devices being manufactured as the technology behind them develops quickly. The high co-channel interference and signal attenuation was seen in edge Narrow Band IoT devices make it challenging to guarantee the service quality of these devices. To maximize the data rate fairness of Narrow Band IoT devices, a multi-dimensional indoor localization model is devised, consisting of...
-
Karolina Lademann Mgr
People -
Integration of Services into Workflow Applications
PublicationDescribing state-of-the-art solutions in distributed system architectures, Integration of Services into Workflow Applications presents a concise approach to the integration of loosely coupled services into workflow applications. It discusses key challenges related to the integration of distributed systems and proposes solutions, both in terms of theoretical aspects such as models and workflow scheduling algorithms, and technical...
-
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 NP-complete or polynomially...
-
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.
-
Domination subdivision and domination multisubdivision numbers of graphs
PublicationThe domination subdivision number sd(G) of a graph G is the minimum number of edges that must be subdivided (where an edge can be subdivided at most once) in order to increase the domination number of G. It has been shown [10] that sd(T)<=3 for any tree T. We prove that the decision problem of the domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the domination multisubdivision number...
-
Three-fast-searchable graphs
PublicationIn the edge searching problem, searchers move from vertex to vertex in a graph to capture an invisible, fast intruder that may occupy either vertices or edges. Fast searching is a monotonic internal model in which, at every move, a new edge of the graph G must be guaranteed to be free of the intruder. That is, once all searchers are placed the graph G is cleared in exactly |E(G)| moves. Such a restriction obviously necessitates...
-
Terrestrial Survey Images - Multispectral Exterior Model - Gdansk Church Pw. Św. Wojciecha - Micasense Dual
Open Research DataDataset description: Raw images from photogrammetric survey. Object: Kościół Rzymskokatolicki Pw. Św. WojciechaLocation: Gdansk, Pomerania, PolandDrone type: N/A (terrestrial images)Flight plan: Free - walk around the object with camera. 3 images taken at the point.Target Product: 3D Model - Multispectral ModelDate: 24.04.2022Direct georeferencing:...
-
Linear game non-contextuality and Bell inequalities—a graph-theoretic approach
PublicationWe study the classical and quantum values of a class of one-and two-party unique games, that generalizes the well-known XOR games to the case of non-binary outcomes. In the bipartite case the generalized XOR(XOR-d) games we study are a subclass of the well-known linear games. We introduce a 'constraint graph' associated to such a game, with the constraints defining the game represented by an edge-coloring of the graph. We use the...
-
On Symmetry of Uniform and Preferential Attachment Graphs
PublicationMotivated by the problem of graph structure compression under realistic source models, we study the symmetry behavior of preferential and uniform attachment graphs. These are two dynamic models of network growth in which new nodes attach to a constant number m of existing ones according to some attachment scheme. We prove symmetry results for m=1 and 2 , and we conjecture that for m≥3 , both models yield asymmetry with high...
-
TOTAL DOMINATION MULTISUBDIVISION NUMBER OF A GRAPH
PublicationThe domination multisubdivision number of a nonempty graph G was defined in [3] as the minimum positive integer k such that there exists an edge which must be subdivided k times to increase the domination number of G. Similarly we define the total domination multisubdivision number msd_t (G) of a graph G and we show that for any connected graph G of order at least two, msd_t (G) ≤ 3. We show that for trees the total domination...
-
Experimental study of the impact of notches and holes made in the front edge of adherends on the properties of static and fatigue strength of adhesive joints
PublicationThe paper presents the results of experimental studies aimed at determining the effect of holes and notches at the front edge of adherends on the strength of adhesive joints. Single-lap joints made of S235JR steel sheets joined with Araldite 2014-2 epoxy adhesive were tested. Comparative tests of static strength in the shear test as well as high-cycle fatigue strength tests were carried out. Joints with three holes with a diameter...
-
Mobility Management Solutions for IP Networks Comparative Analysis of IP-based Mobility Protocols and Handover Algorithms Invited Paper
PublicationA rapid growth of IP-based networks and services hascreated a vast collection of resources and functionalities availableto users by means of a uniform method of access offered by the IPprotocol. At the same time, advances in the design of mobileelectronic devices allowed them to reach a utility levelcomparable to desktop computers, while still retaining theirmobility advantage. Unfortunately, the base IP protocol does notperform...
-
Axial capacity of steel built-up battened columns
PublicationThis paper deals with the numerical investigation aimed to study the axial capacity of pin-ended steel built-up columns. Three methods of calculating forces in chords and batten, taking into account the material and geometric imperfections specified in the Eurocode 3 are considered. The aim of this study was to compare different methods allowing the calculation of the column load capacity and determine a simpler and faster method...
-
On-line Ramsey Numbers of Paths and Cycles
PublicationConsider a game played on the edge set of the infinite clique by two players, Builder and Painter. In each round, Builder chooses an edge and Painter colours it red or blue. Builder wins by creating either a red copy of $G$ or a blue copy of $H$ for some fixed graphs $G$ and $H$. The minimum number of rounds within which Builder can win, assuming both players play perfectly, is the \emph{on-line Ramsey number} $\tilde{r}(G,H)$. In...
-
Mitigation of the Flow Maldistribution in Minichannel and Minigap Heat Exchangers by Introducing Threshold in the Manifolds
PublicationIn the present paper, a detailed numerical investigation has been carried out to analyze the flow maldistribution in 50 parallel rectangular cross-section (1 mm depth and 1 mm width) minichannels and minigap section (1 mm depth and 99 mm width) with rectangular/trapezoidal manifolds in Z-type flow configuration. The author carried out numerical investigation with various mass flowrates, namely 0.05 kg/s, 0.1 kg/s and 0.2 kg/s which...
-
Service time distribution influence on end-to-end call setup delay calculation in networks with Session Initiation Protocol
PublicationThe most important GoS parameter for networks with SIP protocol is end-to-end call setup delay. So far there were no coherent models allowing calculation of these parameters for networks with SIP protocol. Few models were developed but they are insufficient. In the paper we propose model which allows end-to-end call setup delay calculation for networks with SIP protocol. The model is using chain of M/G/1/K models and is applicable...
-
Graph Decomposition for Memoryless Periodic Exploration
PublicationWe consider a general framework in which a memoryless robot periodically explores all the nodes of a connected anonymous graph by following local information available at each vertex. For each vertex v, the endpoints of all edges adjacent to v are assigned unique labels within the range 1 to deg (v) (the degree of v). The generic exploration strategy is implemented using a right-hand-rule transition function: after entering vertex...
-
Hybrid P3HT: PCBM/GaN nanowire/Si cascade heterojunction for photovoltaic application
PublicationPoly(3-hexylthiophene) (P3HT) and phenyl-C61-butyric acid methyl ester (PCBM) are commonly used for the fabrication of organic photovoltaics (OPV). Efficiency limitations of OPVs could be circumvented by incorporation of inorganic nanostructures into organic blends. Again, integration of organic solar cells with well-developed silicon photovoltaic technology is ultimately desirable. In present work, GaN nanowires with diameters...
-
Comparative analysis of IP-based mobility protocols and fast handover algorithms in IEEE 802.11 based WLANs
PublicationA rapid growth of IP-based networks and services created the vast collection of resources and functionality available to users by means of an uniform method of access - an IP protocol. At the same time, advances in design of mobile electronic devices allowed them to reach utility level comparable to stationary, desktop computers, while still retaining their mobility advantage. Unfortunately, the base IP protocol does not perform...
-
Flow Boiling in Minigap in the Reversed Two-Phase Thermosiphon Loop
PublicationThe paper presents the results of experimental investigations of a model of a heat exchanger featuring a minigap, which is perceived as an evaporator for an inverted thermosiphon. The system works with a single component test fluid. The tested evaporator generates pumping power in the test loop in a way similar to the mammoth pump. The tests regarded a module of the heat exchanger, consisting of a hot leg and a cold leg with the...
-
Fabrication and photoactivity of ionic liquid–TiO2 structures for efficient visible-light-induced photocatalytic decomposition of organic pollutants in aqueous phase
PublicationTo investigate the effect of the ionic liquid (IL) chain length on the surface properties and photoactivity of TiO2, a series of TiO2 microspheres have been synthesized via a solvothermal method assisted by 1-methyl-3-octadecylimidazolium chloride ([ODMIM][Cl]) and 1-methyl-3-tetradecylimidazolium chloride ([TDMIM][Cl]). All as-prepared samples were characterized by X-ray powder diffraction (XRD), X-ray photoelectron spectroscopy...
-
A NOTE ON ON-LINE RAMSEY NUMBERS FOR QUADRILATERALS
PublicationWe consider on-line Ramsey numbers defined by a game played between two players, Builder and Painter. In each round Builder draws an the edge and Painter colors it either red or blue, as it appears. Builder’s goal is to force Painter to create a monochromatic copy of a fixed graph H in as few rounds as possible. The minimum number of rounds (assuming both players play perfectly) is the on-line Ramsey number \widetilde{r}(H) of...
-
Independent Domination Subdivision in Graphs
PublicationA set $S$ of vertices in a graph $G$ is a dominating set if every vertex not in $S$ is adjacent to a vertex in~$S$. If, in addition, $S$ is an independent set, then $S$ is an independent dominating set. The independent domination number $i(G)$ of $G$ is the minimum cardinality of an independent dominating set in $G$. The independent domination subdivision number $\sdi(G)$ is the minimum number of edges that must be subdivided (each...
-
Novel Coplanar-Strip-Based Excitation Technique for Design of Broadband Circularly Polarization Antennas with Wide 3-dB Axial Ratio Beamwidth
PublicationIn this paper, a novel excitation technique for design of a single-point-fed compact low-profile wide-slot antennas with broadband circular polarization (CP) and wide 3 dB axial ratio (AR) beamwidth is presented. Two inverted L-shape parasitic strips placed coplanar to the microstrip line of an asymmetric CPW, and a horizontal strip that protrudes from the vertical edge of the backside ground plane of the substrate are used for...
-
Partial Admission Stages of High Efficiency for a Microturbine
PublicationThe paper presents the results of a design analysis of a microturbine for a cogeneration micro-power plant working in accordance with organic Rankine cycle. The heat power of the plant is assumed equal to 20kW and the corresponding available electric output is estimated to be about 3 kW. After the design analysis, the axial turbine with partial admission in all stages was built and tested experimentally. Special attentionwas paid...
-
Chitosan-based electrospun nanofibers for encapsulating food bioactive ingredients: A review
PublicationToday, society has been more aware of healthy food products and related items containing bioactive compounds, which potentially contribute to human health. Unfortunately, the long-term stability and bioactivity of biologically active compounds against environmental factors compromise their target and effective action. In this way, lab-designed vehicles, such as nanoparticles and nanofibers, provide enough properties for their preservation...
-
Additive Manufacturing as a Solution to Challenges Associated with Heat Pipe Production
PublicationThe aim of this review is to present the recent developments in heat pipe production, which respond to the current technical problems related to the wide implementation of this technology. A novel approach in HP manufacturing is to utilise hi-tech additive manufacturing techniques where the most complicated geometries are fabricated layer-by-layer directly from a digital file. This technology might be a solution to various challenges...
-
Measurement report: Spatial variations in ionic chemistry and water-stable isotopes in the snowpack on glaciers across Svalbard during the 2015–2016 snow accumulation season
PublicationThe Svalbard archipelago, located at the Arctic sea-ice edge between 74 and 81∘ N, is ∼60 % covered by glaciers. The region experiences rapid variations in atmospheric flow during the snow season (from late September to May) and can be affected by air advected from both lower and higher latitudes, which likely impact the chemical composition of snowfall. While long-term changes in Svalbard snow chemistry have been documented in...
-
Thermographic imaging of electrochemical double layer capacitors during cycling charging - discharging 0 - 2,8 V at 241 mA. Sample 24, run #3.
Open Research DataDataset contains thermal images of prototype electrochemical double layer capacitor taken during cyclic charging - discharging. The sample was charged to 2,8 V and discharged to 10 mV by constant current 241 mA, experiment run #3.The images were taken with thermographic camera VigoCAM V50. The sample was covered by black graphite paint to ensure uniform...
-
Thermographic imaging of electrochemical double layer capacitors during cycling charging - discharging 0 - 3,1 V at 561 mA. Sample 71, run #3.
Open Research DataDataset contains thermal images of prototype electrochemical double layer capacitor taken during cyclic charging - discharging. The sample was charged to 3,1 V and discharged to 10 mV by constant current 561 mA. Sample 71, experiment run #3.The images were taken with thermographic camera VigoCAM V50. The sample was covered by black graphite paint to...
-
Thermographic imaging of electrochemical double layer capacitors during cycling charging - discharging 0 - 2,7 V at 306 mA. Sample 51, run #3.
Open Research DataDataset contains thermal images of prototype electrochemical double layer capacitor taken during cyclic charging - discharging. The sample was charged to 2,7 V and discharged to 10 mV by constant current 306 mA. Experiment run #3. The images were taken with thermographic camera VigoCAM V50. The sample was covered by black graphite paint to ensure uniform...
-
Optical Sensor Based Gestures Inference Using Recurrent Neural Network in Mobile Conditions
PublicationIn this paper the implementation of recurrent neural network models for hand gesture recognition on edge devices was performed. The models were trained with 27 hand gestures recorded with the use of a linear optical sensor consisting of 8 photodiodes and 4 LEDs. Different models, trained off-line, were tested in terms of different network topologies (different number of neurons and layers) and different effective sampling frequency...
-
Enhanced Photoelectrocatalytical Performance of Inorganic-Inorganic Hybrid Consisting BiVO4, V2O5, and Cobalt Hexacyanocobaltate as a Perspective Photoanode for Water Splitting
PublicationThin layers of BiVO4/V2O5 were prepared on FTO substrates using pulsed laser deposition technique. The method of cobalt hexacyanocobaltate (Cohcc) synthesis on the BiVO4/V2O5 photoanodes consists of cobalt deposition followed by electrochemical oxidation of metallic Co in K3[Co(CN)6] aqueous electrolyte. The modified electrodes were tested as photoanodes for water oxidation under simulated sunlight irradiation. Deposited films...
-
A collection of directed graphs for the minimum cycle mean weight computation
Open Research DataThis dataset contains definitions of the 16 directed graphs with weighted edges that were described in the following paper: Paweł Pilarczyk, A space-efficient algorithm for computing the minimum cycle mean in a directed graph, Journal of Mathematics and Computer Science, 20 (2020), no. 4, 349--355, DOI: 10.22436/jmcs.020.04.08, URL: http://dx.doi.org/10.22436/jmcs.020.04.08 These...
-
Thermographic imaging of electrochemical double layer capacitors during cycling charging - discharging 0 - 2,7 V at 102 mA. Sample 51, run #3.
Open Research DataDataset contains thermal images of prototype electrochemical double layer capacitor taken during cyclic charging - discharging. The sample was charged to 2,7 V and discharged to 10 mV by constant current 102 mA. Experiment run #3. This experiment was preceded by experiment 10.34808/m9mn-yy02. The images were taken with thermographic camera VigoCAM V50....
-
Thermographic imaging of electrochemical double layer capacitors during cycling charging - discharging 0 - 2,7 V at 204 mA. Sample 51, run #3.
Open Research DataDataset contains thermal images of prototype electrochemical double layer capacitor taken during cyclic charging - discharging. The sample was charged to 2,7 V and discharged to 10 mV by constant current 204 mA. Experiment run #3. This experiment was preceded by experiment 10.34808/jf84-x137. The images were taken with thermographic camera VigoCAM V50....
-
Thermographic imaging of electrochemical double layer capacitors during cycling charging - discharging 0 - 2,7 V at 1281 mA. Sample J51, run #3.
Open Research DataDataset contains thermal images of prototype electrochemical double layer capacitor taken during cyclic charging - discharging. The sample was charged to 2,7 V and discharged to 10 mV by constant current 1098 mA. Sample J51, experiment run #3. The current is extremely high for this type of sample to accelerate ageing processes.The images were taken...
-
Thermographic imaging of electrochemical double layer capacitors during cycling charging - discharging 0 - 2,7 V at 534 mA. Sample J53, run #3.
Open Research DataDataset contains thermal images of prototype electrochemical double layer capacitor taken during cyclic charging - discharging. The sample was charged to 2,7 V and discharged to 10 mV by constant current 534 mA. Sample J53, experiment run #3. The period of images is 30 minutes in order to observe slow temperature fluctuations.The images were taken...
-
Thermographic imaging of electrochemical double layer capacitors during cycling charging - discharging 0 - 2,9 V at 420 mA. Sample 103, run #3.
Open Research DataDataset contains thermal images of prototype electrochemical double layer capacitor taken during cyclic charging - discharging. The sample was charged to 2,9 V and discharged to 10 mV by constant current 420 mA. Sample 103, experiment run #3. Voltage was increased to accelerate the ageing process.The images were taken with thermographic camera VigoCAM...
-
Thermographic imaging of electrochemical double layer capacitors during cycling charging - discharging 0 - 3,6 V at 420 mA. Sample 103, run #3.
Open Research DataDataset contains thermal images of prototype electrochemical double layer capacitor taken during cyclic charging - discharging. The sample was charged to 3,6 V and discharged to 10 mV by constant current 420 mA. Sample 103, experiment run #3. Continuation of experiment at high voltage to accelerate the ageing process.The images were taken with thermographic...
-
Joanna Raczek dr inż.
PeopleEmployment 2003 -- 2019: Faculty of Applied Physics and Mathematics, Gdańsk University of Technology. 2019 - present: Faculty of Electronic, Informatics and Telecominications, Gdańsk University of Technology. Education May 2007: Doctor of Philosophy in Mathematics, University of Gdańsk. Doctoral dissertation: "Paired domination and doubly domination in graphs". Supervisor: dr hab. Jerzy Topp. 2000 -- 2004 Bachelor of Science...
-
Trust Management Method for Wireless Sensor Networks
PublicationA Wireless Sensor Network (WSN) is a network of spatially distributed autonomous sensors to monitor physical or environmental conditions, such as temperature, sound, pressure, etc. and to cooperatively pass their data to the main location. The first wireless network that bore any real resemblance to a modern WSN is the Sound Surveillance System (SOSUS), developed by the United States Military in the 1950s to detect and track Soviet...
-
Thermographic imaging of electrochemical double layer capacitors during cycling charging - discharging 0 - 3,6 V at 420 mA. Sample 103, run #3. Image period: 0,5 sec.
Open Research DataDataset contains thermal images of prototype electrochemical double layer capacitor taken during cyclic charging - discharging. The sample was charged to 3,6 V and discharged to 10 mV by constant current 420 mA. Sample 103. Pictures were taken with period of 0,5 sec (2 Hz) in order to examine the fast fluctuations of sample temperature during charging...