Filtry
wszystkich: 3389
wybranych: 1826
-
Katalog
- Publikacje 1819 wyników po odfiltrowaniu
- Czasopisma 100 wyników po odfiltrowaniu
- Konferencje 38 wyników po odfiltrowaniu
- Wydawnictwa 3 wyników po odfiltrowaniu
- Osoby 96 wyników po odfiltrowaniu
- Wynalazki 9 wyników po odfiltrowaniu
- Projekty 64 wyników po odfiltrowaniu
- Laboratoria 2 wyników po odfiltrowaniu
- Zespoły Badawcze 11 wyników po odfiltrowaniu
- Aparatura Badawcza 1 wyników po odfiltrowaniu
- Kursy Online 390 wyników po odfiltrowaniu
- Wydarzenia 8 wyników po odfiltrowaniu
- Dane Badawcze 848 wyników po odfiltrowaniu
Filtry wybranego katalogu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: gra
-
Interval edge-coloring of graphs.
PublikacjaRozdział 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.
-
Equitable vertex coloring of graphs
PublikacjaW 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.
-
Non-isolating bondage in graphs
PublikacjaA dominating set of a graph $G = (V,E)$ is a set $D$ of vertices of $G$ such that every vertex of $V(G) \setminus D$ has a neighbor in $D$. The domination number of a graph $G$, denoted by $\gamma(G)$, is the minimum cardinality of a dominating set of $G$. The non-isolating bondage number of $G$, denoted by $b'(G)$, is the minimum cardinality among all sets of edges $E' \subseteq E$ such that $\delta(G-E') \ge 1$ and $\gamma(G-E')...
-
Global defensive sets in graphs
PublikacjaIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
Bondage number of grid graphs
PublikacjaThe bondage number b(G) of a nonempty graph G is the cardinality of a smallest set of edges whose removal from G results in a graph with domination number greater than the domination number of G. Here we study the bondage number of some grid-like graphs. In this sense, we obtain some bounds or exact values of the bondage number of some strong product and direct product of two paths.
-
Deterministic Rendezvous in Restricted Graphs
PublikacjaIn this paper we consider the problem of synchronous rendezvous in which two anonymous mobile entities (robots) A and B are expected to meet at the same time and point in a graph G = (V;E). Most of the work devoted to rendezvous in graphs assumes that robots have access to the same sets of nodes and edges, where the topology of connections may be initially known or unknown. In our work we assume the movement of robots is restricted...
-
Algorithms for testing security in graphs
PublikacjaIn this paper we propose new algorithmic methods giving with the high probability the correct answer to the decision problem of security in graphs. For a given graph G and a subset S of a vertex set of G we have to decide whether S is secure, i.e. every subset X of S fulfils the condition: |N[X] \cap S| >= |N[X] \ S|, where N[X] is a closed neighbourhood of X in graph G. We constructed a polynomial time property pseudotester based...
-
Parity vertex colouring of graphs
PublikacjaA parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let Xp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds X(G) <= Xp(G) <=|V(G)|− a(G)+1, where X(G) and a(G) are the chromatic number and the independence number of G, respectively. The bounds are improved for...
-
On efficient coloring of chordless graphs
PublikacjaArtykuł omawia zagadnienie optymalnego, wielomianowego rozpoznawania i kolorowania grafów bezcięciwowych. Zawiera dowód tego, że takie grafy są zawsze 4-kolorowalne oraz opis wielomianowego algorytmu, który koloruje je minimalną możliwą liczbą kolorów.
-
Super Dominating Sets in Graphs
PublikacjaIn this paper some results on the super domination number are obtained. We prove that if T is a tree with at least three vertices, then n2≤γsp(T)≤n−s, where s is the number of support vertices in T and we characterize the extremal trees.
-
A note on total reinforcement in graphs
PublikacjaIn this note we prove a conjecture and inprove some results presendet in a recent paper of N. Sridharan, M.D. Elias, V.S.A. Subramanian, Total reinforcement number of a graph, AKCE Int. J. Graphs Comb. 4 (2) (2007) 197-202.
-
Global edge alliances in graphs
PublikacjaIn the paper we introduce and study a new problem of finding a minimum global edge alliance in a graph which is related to the global defensive alliance (Haynes et al., 2013; Hedetniemi, 2004) and the global defensive set (Lewoń et al., 2016). We proved the NP-completeness of the global edge alliance problem for subcubic graphs and we constructed polynomial time algorithms for trees. We found the exact values of the size of the...
-
Three-fast-searchable graphs
PublikacjaIn 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...
-
On-line ranking of split graphs
PublikacjaA vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the worst case ratio of the number of colors used by any on-line ranking algorithm...
-
Total restrained bondage in graphs
PublikacjaPodzbiór D zbioru wierzchołków grafu nazywamy zewnętrznie totalnym dominującym w grafie, jeśli każdy wierzchołek spoza D ma sąsiada zarówno w D jak i poza D. Moc najmniejszego zbioru o tej własności nazywamy liczbą dominowania zewnętrznie totalnego. W artykule badamy wpływ usuwania krawędzi na liczbę dominowania zewnętrznie totalnego, czyli liczbę zewnętrznego totalnego zniewolenie w grafach.
-
Secure Italian domination in graphs
PublikacjaAn Italian dominating function (IDF) on a graph G is a function f:V(G)→{0,1,2} such that for every vertex v with f(v)=0, the total weight of f assigned to the neighbours of v is at least two, i.e., ∑u∈NG(v)f(u)≥2. For any function f:V(G)→{0,1,2} and any pair of adjacent vertices with f(v)=0 and u with f(u)>0, the function fu→v is defined by fu→v(v)=1, fu→v(u)=f(u)−1 and fu→v(x)=f(x) whenever x∈V(G)∖{u,v}. A secure Italian dominating...
-
Independent Domination Subdivision in Graphs
PublikacjaA 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...
-
Some variations of perfect graphs
PublikacjaWe consider (ψk−γk−1)-perfect graphs, i.e., graphs G for which ψk(H) =γk−1(H) for any induced subgraph H of G, where ψk and γk−1 are the k -path vertex cover number and the distance (k−1)-domination number, respectively. We study (ψk−γk−1)-perfect paths, cycles and complete graphs for k≥2. Moreover, we provide a complete characterisation of (ψ2−γ1)-perfect graphs describing the set of its forbidden induced subgraphs and providing...
-
On-line P-coloring of graphs
PublikacjaFor a given induced hereditary property P, a P-coloring of a graph G is an assignment of one color to each vertex such that the subgraphs induced by each of the color classes have property P. We consider the effectiveness of on-line P-coloring algorithms and give the generalizations and extensions of selected results known for on-line proper coloring algorithms. We prove a linear lower bound for the performance guarantee function...
-
Comparison of pathological staging and grading of urothelial bladder carcinoma in post-transurethral resection and post-radical cystectomy specimens
Publikacja -
Search for new tools to combat Gram-negative resistant bacteria among amine derivatives of 5-arylidenehydantoin
Publikacja -
Numerical analysis of open channel steady gradually varied flow using the simplified saint-venant equations
PublikacjaFor one-dimensional open-channel flow modeling, the energy equation is usually used. There exist numerous approaches using the energy equation for open-channel flow computations, which resulted in the development of several very efficient methods for solving this problem applied to channel networks. However, the dynamic equation can be used for this purpose as well. This paper introduces a method for solving a system of non-linear...
-
Method to solve the non-linear systems of equations for steady gradually varied flow in open channel network.
PublikacjaW artykule omówiono rozwiązanie systemu równań nieliniowych opisujacych przepływ ustalony wolnozmienny w sieci kanałów otwartych. Niewiadomymi są glębokości w poszczególnych przekrojach oraz natężenia przepływów w poszczególnych gałęziach systemu. Układ musi być rozwiązywany iteracyjnie. Klasyczne metody Picarda i Newtona mogą okazać się nieskuteczne ze względu na oscylacje rozwiązania w kolejnych iteracjach i związany z tym brak...
-
The pollutant transport equation for a steady, gradually varied flow in an open channel network: a solution of high accuracy
PublikacjaW pracy przedstawiono metodę rozwiązania jednowymiarowego równania adwekcji-dyfuzji opisującego transport zanieczyszczeń w warunkach przepływu ustalonego wolnozmiennego w sieci kanałów otwartych. Zastosowano technikę dekompozycji. Zlineoryzowane równanie adwekcji-dyfuzji rozwiązano stosując całkę Duhamela, zaś równanie zacierające człon źródłowy-metodą różnic skończonych. Metoda zapewnia bardzo dużą dokładność rozwiązania nawet...
-
Lax-Wendroff and McCormack Schemes for Numerical Simulation of Unsteady Gradually and Rapidly Varied Open Channel Flow
PublikacjaTwo explicit schemes of the finite difference method are presented and analyzed in the paper. The applicability of the Lax-Wendroff and McCormack schemes for modeling unsteady rapidly and gradually varied open channel flow is investigated. For simulation of the transcritical flow the original and improved McCormack scheme is used. The schemes are used for numerical solution of one dimensional Saint-Venant equations describing free...
-
Some aspects of the constitutive modelling of natural fine grained soils
PublikacjaThe monograph deals with selected problems of the constitutive modelling of natural fine grained soils commonly known as clays. The main idea is not to propose a unified model which is capable of describing all known features of mechanical behaviour of fine grained soils. Instead, separate models are proposed describing the mechanical behaviour of heavily overconsolidated, lightly overconsolidated and normally consolidated clays....
-
Risk factors of depressive and anxiety symptoms 8 years after coronary artery bypass grafting
Publikacja -
Grafting and reactive extrusion technologies for compatibilization of ground tyre rubber composites: Compounding, properties, and applications
PublikacjaChemical modification of ground tyre rubber (GTR) to compatibilize it with the matrix is a well-known approach. Based on our recent review of the surface etching methods used in GTR modification, the purpose of the current work is to take a deeper look into more advanced methods such as grafting and reactive extrusion. While grafting is more efficient in achieving compatibility, however, it usually involves multi-step synthesis...
-
Modelowanie i symulacja maszyn elektrycznych metodą grafów wiązań.
PublikacjaW artykule przedstawiono modelowanie maszyn elektrycznych metodą grafów wiązań dla potrzeb symulacji szeroko pojętych systemów energetycznych, w szczególności systemów o naturze hybrydowej. Opisano zarys podstaw modelowania metodą grafów wiązań. Omówiono ogólne założenia modelowania maszyn elektrycznych w ujęciu grafów wiązań, bazującego na modelach obwodowych wzorcowego sprzężenia transformatorowego i elektromechanicznego. Wykorzystując...
-
Samostabilizujący się algorytm kolorowania grafów dwudzielnych i kaktusów
PublikacjaW pracy rozważa się rozproszony model obliczeń, w którym struktura systemu jest reprezentowana przez graf bezpośrednich połączeń komunikacyjnych. W tym modelu podajemy nowy samostabilizujący algorytm kolorowania grafów oparty na konstrukcji drzewa spinającego. Zgodnie z naszą wiedzą jest to pierwszy algorytm z gwarantowaną wielomianową liczbą ruchów, który dokładnie koloruje grafy dwudzielne.
-
Zastosowania metodyki Kansei do doskonalenia interfejsów oprogramowania wykorzystywanego w telepracy
PublikacjaArtykuł przedstawia możliwości wykorzystania metodyki Kansei Engineering do projektowania ulepszeń interfejsów oprogramowania wykorzystywanego w prowadzeniu telepracy. W artykule zostały zaprezentowane: podstawy metodyki Kansei Engineering, informacje o telepracy oraz podstawowe zagadnienia związane z projektowaniem interfejsów oprogramowania.
-
Effect of Long-Term Storage on Mycobiota of Barley Grain and Malt
Publikacja -
Geometrically Nonlinear Analysis of Functionally Graded Shells Based on 2-D Cosserat Constitutive Model
PublikacjaIn this paper geometrically nonlinear analysis of functionally graded shells in 6-parameter shell theory is presented. It is assumed that the shell consists of two constituents: ceramic and metal. The mechanical properties are graded through the thickness and are described by power law distribution. Formulation based on 2-D Cosserat constitutive model is used to derive constitutive relation for functionally graded shells. Numerical...
-
Nonlocal elasticity analysis of moderately thick porous functionally graded plates in a hygro-thermal environment
PublikacjaThis work performs a novel quasi three-dimensional (3D) bending analysis for a moderately thick functionally graded material (FGM) made of nanoceramics and metal powders, in presence of porosities due to some incorrect manufacturing processes. Such porosities can appear within the plate in two forms, namely, even and uneven distributions. The modeled system assumes a polymer matrix where both shear and transverse factors coexist....
-
Tribological and corrosion testing of surface engineered surgical grade CoCrMo alloy
Publikacja -
TRAVELLING WAVES FOR LOW–GRADE GLIOMA GROWTH AND RESPONSE TO A CHEMOTHERAPY MODEL
PublikacjaLow-grade gliomas (LGGs) are primary brain tumours which evolve very slowly in time, but inevitably cause patient death. In this paper, we consider a PDE version of the previously proposed ODE model that describes the changes in the densities of functionally alive LGGs cells and cells that are irreversibly damaged by chemotherapy treatment. Besides the basic mathematical properties of the model, we study the possibility of the...
-
Adsorption study of surfactants and biosurfactants mixtures at different interfaces
PublikacjaZbadano napięcia powierzchniowe i międzyfazowe roztworów mieszaniny surfaktantów niejonowych (Rokanol L7 i Rokanol NL8) i biosurfaktantu (JBR 425) i ich mieszanin. Olejową fazę stanowił dodekan oraz olej bazowy PAO. Wykazano synergizm wartości napięcia międzyfazowego przy CMC jedynie w przypadku mieszaniny Rokanolu L7 i JBR 425 i tylko dla granicy faz olej/woda.
-
MM/PBSA analysis of molecular dynamics simulations of bovine beta-lactoglobulin: free energy gradients in conformational transitions?
PublikacjaPraca dotyczy pH zależnych zmian konformacyjnych EF pętli beta-laktoglobuliny. Zmiany te są śledzone za pomocą metod obliczeniowych chemii (dynamika molekularna oraz metody MM/PBSA).
-
Serum Anti-Müllerian Hormone Levels in Patients with Epithelial Ovarian Cancer
Publikacja -
The effect of exogenous application of methyl jasmonate on the lipid and carbohydrate content and composition of winter triticale (Triticosecale Wittm.) grain and the severity of fungal infections in triticale plants and grain
PublikacjaKernels of winter triticale (Triticosecale Wittm. cv. Dinaro) were analyzed. In the autumn of 2015, the effect of methyl jasmonate (MJ) on the germination of triticale kernels and the development of triticale seedlings was analyzed in a laboratory before kernels were sown in experimental plots. Kernels harvested from plots in August 2016 were analyzed to determine their lipid and carbohydrate content and composition and the severity...
-
Grafo-mania, czyli rzecz o grafach i algorytmach. Twierdzenie o czterech barwach
PublikacjaPrzedstawiono istotę i historię twierdzenia o 4 barwach.
-
Efflux Pump Blockers in Gram-Negative Bacteria: The New Generation of Hydantoin Based-Modulators to Improve Antibiotic Activity
Publikacja -
Relations between the domination parameters and the chromatic index of a graph
PublikacjaIn this paper we show bounds for the sum and the product of the domination parameters and the chromatic index of a graph. We alsopresent some families of graphs for which these bounds are achieved.
-
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.
-
Greedy algorithms for backbone graph coloring in KOALA library
Publikacja -
Constructing a map of an anonymous graph: applications of universal sequences
PublikacjaWe study the problem of mapping an unknown environmentrepresented as an unlabelled undirected graph. A robot (or automaton)starting at a single vertex of the graph G has to traverse the graph and return to its starting point building a map of the graph in the process. We are interested in the cost of achieving this task (whenever possible) in terms of the number of edge traversal made by the robot. Another optimization criteria...
-
Pawlak's flow graph extensions for video surveillance systems
PublikacjaThe idea of the Pawlak's flow graphs is applicable to many problems in various fields related to decision algorithms or data mining. The flow graphs can be used also in the video surveillance systems. Especially in distributed multi-camera systems which are problematic to be handled by human operators because of their limited perception. In such systems automated video analysis needs to be implemented. Important part of this analysis...
-
On Tradeoffs Between Width- and Fill-like Graph Parameters
PublikacjaIn this work we consider two two-criteria optimization problems: given an input graph, the goal is to find its interval (or chordal) supergraph that minimizes the number of edges and its clique number simultaneously. For the interval supergraph, the problem can be restated as simultaneous minimization of the path width pw(G) and the profile p(G) of the input graph G. We prove that for an arbitrary graph G and an integer t ∈ {1,...
-
Nordhaus-Gaddum results for the convex domination number of a graph
PublikacjaPraca dotyczy nierówności typu Nordhausa-Gadduma dla dominowania wypukłego.
-
Scheduling with Complete Multipartite Incompatibility Graph on Parallel Machines
PublikacjaIn 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...