Filters
total: 3389
filtered: 1819
-
Catalog
- Publications 1819 available results
- Journals 100 available results
- Conferences 38 available results
- Publishing Houses 3 available results
- People 96 available results
- Inventions 9 available results
- Projects 64 available results
- Laboratories 2 available results
- Research Teams 11 available results
- Research Equipment 1 available results
- e-Learning Courses 390 available results
- Events 8 available results
- Open Research Data 848 available results
Chosen catalog filters
displaying 1000 best results Help
Search results for: gra
-
Graphs with convex domination number close to their order
PublicationW pracy opisane są grafy z liczbą dominowania wypukłego bliską ilości ich wierzchołków.
-
Sum Coloring of Bipartite Graphs with Bounded Degree
Publication -
Strong weakly connected domination subdivisible graphs
PublicationArtykuł dotyczy wpływu podziału krawędzi na liczbę dominowania słabo spójnego. Charakteryzujemy grafy dla których podział dowolnej krawędzi zmienia liczbę dominowania słabo spójnego oraz grafy dla których podział dowolnych dwóch krawędzi powoduje zmianę liczby dominowania słabo spójnego.
-
program verification strategy and edge ranking of graphs
PublicationW artykule rozważamy model, w którym zakładamy, że dany jest zbiór asercji/testów dla pewnych bloków programu. Celem jest znalezienie optymalnej, tzn. wymagającej wykonania minimalnej liczby testów strategii wyszukiwania błędu w kodzie programu. Pomimo założenia w modelu, iż program posiada dokładnie jeden błąd, rozważania można uogólnić na testowanie kodu z dowolną liczbą błędów. Analizujemy teoretyczne własności tego modelu oraz...
-
On extremal sizes of locally k-tree graphs
PublicationA graph G is a locally k-tree graph if for any vertex v the subgraph induced by the neighbours of v is a k-tree, k>=0, where 0-tree is an edgeless graph, 1-tree is a tree. We characterize the minimum-size locally k-trees with n vertices. The minimum-size connected locally k-trees are simply (k + 1)-trees. For k >= 1, we construct locally k-trees which are maximal with respect to the spanning subgraph relation. Consequently, the...
-
Parallel query processing and edge ranking of graphs
PublicationArtykuł poświęcony jest problemowi szukania drzewa spinającego o minimalnym uporządkowanym indeksie chromatycznym. Jednym z zastosowań jest poszukiwanie optymalnych harmonogramów w równoległym przetwarzaniu zapytań w relacyjnych bazach danych. Podajemy nowe oszacowanie funkcji dobroci przybliżonego algorytmu autorstwa Makino, Uno i Ibaraki wraz z rezultatami testów komputerowych przeprowadzonych dla grafów losowych.
-
Sum coloring of bipartite graphs with bounded degree.
PublicationArtykuł 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.
-
Cholesky factorization of matrices in parallel and ranking of graphs.
PublicationUporządkowane kolorowanie znajduje zastosowanie przy równoległej faktoryzacji macierzy metodą Cholesky'ego. Praca zawiera opis tego zastosowania. Podano także algorytmy optymalnego uporządkowanego kolorowania krawędzi pewnych klas grafów: grafów pełnych dwudzielnych oraz powstałych z pełnych dwudzielnych przez usunięcie O(log n) krawędzi.
-
Edge and Pair Queries-Random Graphs and Complexity
PublicationWe investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters is NP-hard for bounded degree graphs.
-
On bipartization of cubic graphs by removal of an independent set
PublicationWe study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set.
-
Domination-Related Parameters in Rooted Product Graphs
PublicationAbstract A set S of vertices of a graph G is a dominating set in G if every vertex outside of S is adjacent to at least one vertex belonging to S. A domination parameter of G is related to those sets of vertices of a graph satisfying some domination property together with other conditions on the vertices of G. Here, we investigate several domination-related parameters in rooted product graphs.
-
Bipartite theory of graphs: outer-independent domination
PublicationLet $G = (V,E)$ be a bipartite graph with partite sets $X$ and $Y$. Two vertices of $X$ are $X$-adjacent if they have a common neighbor in $Y$, and they are $X$-independent otherwise. A subset $D \subseteq X$ is an $X$-outer-independent dominating set of $G$ if every vertex of $X \setminus D$ has an $X$-neighbor in $D$, and all vertices of $X \setminus D$ are pairwise $X$-independent. The $X$-outer-independent domination number...
-
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),...
-
Towards Increasing Density of Relations in Category Graphs
PublicationIn the chapter we propose methods for identifying new associations between Wikipedia categories. The first method is based on Bag-of-Words (BOW) representation of Wikipedia articles. Using similarity of the articles belonging to different categories allows to calculate the information about categories similarity. The second method is based on average scores given to categories while categorizing documents by our dedicated score-based...
-
Graphs with equal domination and certified domination numbers
PublicationA setDof vertices of a graphG= (VG,EG) is a dominating set ofGif every vertexinVG−Dis adjacent to at least one vertex inD. The domination number (upper dominationnumber, respectively) ofG, denoted byγ(G) (Γ(G), respectively), is the cardinality ofa smallest (largest minimal, respectively) dominating set ofG. A subsetD⊆VGis calleda certified dominating set ofGifDis a dominating set ofGand every vertex inDhas eitherzero...
-
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...
-
Decontaminating Arbitrary Graphs by Mobile Agents: a Survey
PublicationA team of mobile agents starting from homebases need to visit and clean all nodes of the network. The goal is to find a strategy, which would be optimal in the sense of the number of needed entities, the number of moves performed by them or the completion time of the strategy. Currently, the field of distributed graph searching by a team of mobile agents is rapidly expanding and many new approaches and models are being presented...
-
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...
-
Total Domination Versus Domination in Cubic Graphs
PublicationA dominating set in a graph G is a set S of vertices of G such that every vertex not in S has a neighbor in S. Further, if every vertex of G has a neighbor in S, then S is a total dominating set of G. The domination number,γ(G), and total domination number, γ_t(G), are the minimum cardinalities of a dominating set and total dominating set, respectively, in G. The upper domination number, \Gamma(G), and the upper total domination...
-
On the size of identifying codes in triangle-free graphs
PublicationIn an undirected graph G, a subset C⊆V(G) such that C is a dominating set of G, and each vertex in V(G) is dominated by a distinct subset of vertices from C, is called an identifying code of G. The concept of identifying codes was introduced by Karpovsky, Chakrabarty and Levitin in 1998. For a given identifiable graph G, let gammaID(G) be the minimum cardinality of an identifying code in G. In this paper, we show that for any connected...
-
Synchronous black hole search in directed graphs
PublicationThe paper considers a team of robots which has to explore a graph G, where some nodes can be harmful. Robots are initially located at the so-called home base node. The dangerous nodes are the so-called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that minimum number of robots is wasted. The exploration ends if there is at least one...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublicationThe paired domination subdivision number sdpr(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 paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
-
Graphs hard-to-process for greedy algorithm MIN
PublicationWe compare results of selected algorithms that approximate the independence number in terms of the quality of constructed solutions. Furthermore, we establish smallest hard- to-process graphs for the greedy algorithm MIN.
-
On the super domination number of lexicographic product graphs
PublicationThe neighbourhood of a vertexvof a graphGis the setN(v) of all verticesadjacent tovinG. ForD⊆V(G) we defineD=V(G)\D. A setD⊆V(G) is called a super dominating set if for every vertexu∈D, there existsv∈Dsuch thatN(v)∩D={u}. The super domination number ofGis theminimum cardinality among all super dominating sets inG. In this article weobtain closed formulas and tight bounds for the super dominating number oflexicographic product...
-
Progress on Roman and Weakly Connected Roman Graphs
PublicationA graph G for which γR(G)=2γ(G) is the Roman graph, and if γwcR(G)=2γwc(G), then G is the weakly connected Roman graph. In this paper, we show that the decision problem of whether a bipartite graph is Roman is a co-NP-hard problem. Next, we prove similar results for weakly connected Roman graphs. We also study Roman trees improving the result of M.A. Henning’s A characterization of Roman trees, Discuss. Math. Graph Theory 22 (2002)....
-
Effect of Grain Husk Microfibers on Physicochemical Properties of Carboxymethyl Polysaccharides-Based Composite
Publication -
Effect of Sieve Unit Inclination Angle in a Rotary Cleaning Device for Barley Grain
Publication -
Enhanced aging resistance of poly(ε-caprolactone)/brewers’ spent grain composites
PublicationThe presented paper investigated the influence of brewers’ spent grain (BSG) extrusion pa-rameters on the photo-oxidative resistance of poly(ε-caprolactone)-based wood polymer composites. Filler samples characterized by the higher melanoidin content were more efficient in hindering of poly-mer degradation, inhibiting the decomposition of the polymer amorphous phase. As aresult, deteriora-tion of mechanical performance was limited,...
-
Blue applicability grade index (BAGI) and software: a new tool for the evaluation of method practicality
PublicationIn this work, blue applicability grade index (BAGI) is proposed as a new metric tool for evaluating the practicality of an analytical method. BAGI can be considered complementary to the well-established green metrics, and it is mainly focused on the practical aspects of White Analytical Chemistry. This tool evaluates ten main attributes including the type of analysis, the number of analytes that are simultaneously determined, the...
-
Impact of steel grade on a ship colliding with an offshore wind turbine monopile supporting structure
PublicationOffshore wind power is experiencing rapid development around the world. The number of installations and their size is growing. Thousands of monopile support structures with diameters of 10 m and weights of 2000 tons will be installed in the coming years. Offshore wind power installations, often located close to the shore and shipping routes, pose a new challenge to ship safety. The study analyses the damages from an accidental...
-
Medical-Grade PCL Based Polyurethane System for FDM 3D Printing—Characterization and Fabrication
PublicationThe widespread use of three-dimensional (3D) printing technologies in medicine has contributed to the increased demand for 3D printing materials. In addition, new printing materials that are appearing in the industry do not provide a detailed material characterization. In this paper, we present the synthesis and characterization of polycaprolactone (PCL) based medical-grade thermoplastic polyurethanes, which are suitable for forming...
-
Modifiers for Medical Grade Polymeric Systems used in FDM 3D Printing - Short Review
PublicationFDM 3D printing could find an application in the wide range of biomedical applications. Unfortunately, the quantity of polymeric biomaterials suitable to processing into filaments is limited. The most frequently used biomaterials for medical constructs such as bone grafts, soft tissue scaffolds or another DDS include PCL, PLA, PVA, HPC, EVA copolymer, EC and TPUs. Various modifiers such as TCP, HA, TEC, MMC could be applicated...
-
Nauczanie bioinżynierii z zastosowaniem narzędzi informatycznych i metod stosowanych w elektrotechnice oraz grafach wiązań
PublicationPrzedstawiono sposoby badań zjawisk zachodzących w krwiobiegu za pomocą obwodów elektrycznych oraz grafów wiązań. Symulacje zjawisk stanowią jeden z elementów nauczania bioinżynierii dla studentów uczelni technicznych.
-
Ts2631 Endolysin from the Extremophilic Thermus scotoductus Bacteriophage vB_Tsc2631 as an Antimicrobial Agent against Gram-Negative Multidrug-Resistant Bacteria
Publication -
Ts2631 Endolysin from the Extremophilic Thermus scotoductus Bacteriophage vB_Tsc2631 as an Antimicrobial Agent against Gram-Negative Multidrug-Resistant Bacteria
Publication -
An investigation on the role of GMA grafting degree on the efficiency of PET/PP-g-GMA reactive blending: morphology and mechanical properties
PublicationGlycidyl methacrylate (GMA) has been grafted on polypropylene (PP) with the aid of styrene (St) comonomer, by changing dicumyl peroxide initiator content, GMA level, and St concentration. The performance of the resulting PP-g-GMA reactive material towards static and dynamic mechanical properties of poly (ethylene terephthalate) (PET) was monitored in terms of grafting reaction variables and compatibilizer content. Fourier transform...
-
Badanie jakości wody w basenach kąpielowych w odniesieniu do technologii jej uzdatniania
PublicationPrzeanalizowano jakość wody w wybranych basenach kąpielowych. Dezynfekcja za pomocą podchlorynu sodu okazała się metodą skuteczną względem bakterii grupy coli, ale losowo pojawiały się w nadmiarze gronkowce koagulazo-dodatnie. Wyższe stężenie podchlorynu sodu likwidowało zagrożenie.
-
Unieszkodliwianie odpadów z uzdatniania wody basenowej
PublicationPostępowanie z odpadami będącymi wynikiem uzdatniania wody z basenów kąpielowych i innych obiektów rekreacyjnych znalazło dotychczas niewielką uwagę w dostępnej literaturze. Zanieczyszczenia wprowadzane do wody basenowej wnoszone są głównie przez użytkowników, ale są też efektem dezynfekcji i uzdatniania wody oraz rozwoju niektórych mikroorganizmów.
-
Fizykochemiczne podstawy uzdatniania wody w basenach kąpielowych
PublicationŹródłem zanieczyszczenia wody w basenie kąpielowym oprócz zanieczyszczeń wprowadzanych przez kapiących się przez wydzielania głównie potu i moczu, są również wniesione pozostałości kosmetyków, jak również niepuprane lu źle wypłukane stroje kapielowe lub zabudzone klapki kapielowe. Innym zagrożeniem jest nieprawidłowe czyszczenie i dezynfekcja otoczenia niecki basenu. Na basenach starego typu mozna spotkać plażen iecki bez zlokalizowanych...
-
Uzdatnianie wody basenowej
PublicationArtykuł jest poświęcony fizykochemicznym podstawom uzdatniania wody w basenach kąpielowych
-
Bending analysis of functionally graded nanoplates based on a higher-order shear deformation theory using dynamic relaxation method
PublicationIn this paper, bending analysis of rectangular functionally graded (FG) nanoplates under a uniform transverse load has been considered based on the modified couple stress theory. Using Hamilton’s principle, governing equations are derived based on a higher-order shear deformation theory (HSDT). The set of coupled equations are solved using the dynamic relaxation (DR) method combined with finite difference (FD) discretization technique...
-
Polyvalent Mechanical Bacterial Lysate Administration Improves the Clinical Course of Grass Pollen–Induced Allergic Rhinitis in Children: A Randomized Controlled Trial
Publication -
Computer experiments with a parallel clonal selection algorithm for the graph coloring problem
PublicationArtificial immune systems (AIS) are algorithms that are based on the structure and mechanisms of the vertebrate immune system. Clonal selection is a process that allows lymphocytes to launch a quick response to known pathogens and to adapt to new, previously unencountered ones. This paper presents a parallel island model algorithm based on the clonal selection principles for solving the Graph Coloring Problem. The performance of...
-
Network Graph Transformation Providing Fast Calculation of Paths for Resilient Routing
PublicationProtection of transmission against failures can be appropriately dealt with by alternative paths. However, common schemes (e.g., Bhandaris scheme) are characterized by a remarkable delay while determining the transmission paths. This in turn may have a serious impact on serving dynamic demands (characterized by relatively short duration time). As a remedy to this problem, we introduce an approach to pre-compute the sets of disjoint...
-
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...
-
A space-efficient algorithm for computing the minimum cycle mean in a directed graph
PublicationAn algorithm is introduced for computing the minimum cycle mean in a strongly connected directed graph with n vertices and m arcs that requires O(n) working space. This is a considerable improvement for sparse graphs in comparison to the classical algorithms that require O(n^2) working space. The time complexity of the algorithm is still O(nm). An implementation in C++ is made publicly available at http://www.pawelpilarczyk.com/cymealg/.
-
Emotion Recognition from Physiological Channels Using Graph Neural Network
PublicationIn recent years, a number of new research papers have emerged on the application of neural networks in affective computing. One of the newest trends observed is the utilization of graph neural networks (GNNs) to recognize emotions. The study presented in the paper follows this trend. Within the work, GraphSleepNet (a GNN for classifying the stages of sleep) was adjusted for emotion recognition and validated for this purpose. The...
-
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:...
-
Geopolityczna analiza potêgi w subregionie Zatoki Perskiej
Publication -
Sectarianism as a Factor Shaping Persian Gulf Security
Publication