Wyszukiwarka
Filtry
wszystkich: 1629
-
Katalog
- Publikacje 1146 wyników po odfiltrowaniu
- Czasopisma 25 wyników po odfiltrowaniu
- Konferencje 19 wyników po odfiltrowaniu
- Osoby 23 wyników po odfiltrowaniu
- Wynalazki 4 wyników po odfiltrowaniu
- Projekty 2 wyników po odfiltrowaniu
- Zespoły Badawcze 1 wyników po odfiltrowaniu
- Kursy Online 46 wyników po odfiltrowaniu
- Wydarzenia 4 wyników po odfiltrowaniu
- Dane Badawcze 359 wyników po odfiltrowaniu
wyświetlamy 1000 najlepszych wyników Pomoc
Wyniki wyszukiwania dla: block graph
-
Coronas and Domination Subdivision Number of a Graph
PublikacjaIn this paper, for a graph G and a family of partitions P of vertex neighborhoods of G, we define the general corona G ◦P of G. Among several properties of this new operation, we focus on application general coronas to a new kind of characterization of trees with the domination subdivision number equal to 3.
-
Non-monotone graph searching models
PublikacjaGraph searching encompasses a variety of different models, many of which share a property that in optimal strategies fugitive can never access once searched regions. Monotonicity, as it is called, is vital in many established results in the field however its absence significantly impedes the analysis of a given problem. This survey attempts to gather non-monotone models, that are less researched in effort of summarizing the results...
-
On the Characteristic Graph of a Discrete Symmetric Channel
PublikacjaWe present some characterizations of characteristic graphs of row and/or column symmetric channels. We also give a polynomial-time algorithm that decides whether there exists a discrete symmetric channel whose characteristic graph is equal to a given input graph. In addition, we show several applications of our results.
-
The convex domination subdivision number of a graph
PublikacjaLet G = (V;E) be a simple graph. A set D\subset V is a dominating set of G if every vertex in V - D has at least one neighbor in D. The distance d_G(u, v) between two vertices u and v is the length of a shortest (u, v)-path in G. An (u, v)-path of length d_G(u; v) is called an (u, v)-geodesic. A set X\subset V is convex in G if vertices from all (a, b)-geodesics belong to X for any two vertices a, b \in X. A set X is a convex dominating...
-
On the doubly connected domination number of a graph
PublikacjaW pracy została zdefiniowana liczba dominowania podwójnie spójnego i przedstawiono jej podstawowe własności.
-
On greedy graph coloring in the distributed model
PublikacjaArtykuł traktuje o zachłannym kolorowaniu grafów w modelu rozproszonym. Zaprezentowano nowy probabilistyczny algorytm dający w wyniku pokolorowanie LF. Udowodniono, że jakakolwiek rozproszona implementacja LF wymaga co najmniej D rund, gdzie D jest maksymalnym stopniem wierzchołka w grafie.
-
Block-based Representation of Application Execution on Modern Parallel Systems
PublikacjaThe chapter presents how to model execution of a parallel computational application that is to be executed in a large-scale parallel or distributed environment with potentially thousands to millions of execution units. The representation uses pre- viously attributes and factors representative of modern high performance systems including multicore CPUs, GPUs, dedicated accelerators such as Intel Phi.
-
Toward Polyethylene–Polyester Block and Graft Copolymers with Tunable Polarity
PublikacjaThe synthesis and characterization of polyethylene–polyester block and graft copolymers and their potential as compatibilizers in polyethylene-based polymer blends are being described. The various routes to functionalized polyethylenes and the corresponding block/graft copolymers have been compared and evaluated for their scalability to industrial scale production. Hydroxyl chain-end and randomly OH-functionalized HDPE as well...
-
Inter Bloc
Czasopisma -
Antioxidative properties of black tea
Publikacja -
Is Black Titania a Promising Photocatalyst?
Publikacja -
Receiver block of antenna amplifier for WLAN systems in 5 GHz band
PublikacjaDwukierunkowe wzmacniacze antenowe (BDA) są często stosowane do zwiększania zasięgu łączności w sieciach bezprzewodowych WLAN. W artykule przedstawiono teorię, procedurę projektową oraz realizację części odbiorczej dwukierunkowego wzmacniacza do systemów WLAN na pasma 5GHz w standardach 802.11a i HiperLAN-2. Analizowano tylko te bloki, które wpływają na parametry toru odbiorczego. Aby ograniczyć koszt wzmacniacza wszystkie obwody...
-
Influence of chemical composition of amide block on the thermal properties and structure of terpolymers
Publikacja -
Organometallic block copolymers as catalyst precursors for templated carbon nanotube growth.
PublikacjaArtykuł przedstawia zastosowanie organometalicznych kopolimerów blokowych jako prekursorów katalizatorów dla syntezy nanorurek węglowych. Zjawisko mikroseparacji fazowej kopolimerów blokowych zostało wykorzystane dla przygotowania matrycy aktywnych katalitycznie domen o rozmiarach ~20 nm. Domeny zawierające poli(ferrocenylosilan) (PFS) po utlenienu w plazmie tlenowej oraz redukcji z Fe(III) do Fe(II) oraz Fe(0) z powodzeniem katalizują...
-
BP-EVD: Forward Block-Output Propagation for Efficient Video Denoising
PublikacjaDenoising videos in real-time is critical in many applications, including robotics and medicine, where varying light conditions, miniaturized sensors, and optics can substantially compromise image quality. This work proposes the first video denoising method based on a deep neural network that achieves state-of-the-art performance on dynamic scenes while running in real-time on VGA video resolution with no frame latency. The backbone...
-
Graph decomposition for improving memoryless periodic exploration
PublikacjaW ostatnich latach często badanym problem jest eksploracja anonimowych grafów z lokalnymi etykietami portów przy każdym wierzchołku. Niedawno pokazano [Czyzowicz et al., Proc. SIROCCO'09], że dla każdego grafu istnieje poetykietowanie prowadzące do eksploracji przez automat bezpamięciowy z okresem co najwyżej 13n/3. W niniejszej pracy poprawiamy to ograniczenie do 4n-2, stosując całkowicie nową technikę dekompozycji grafu.
-
Application of genetic algorithms in graph searching problem
PublikacjaGraph searching is a common approach to solving a problem of capturing a hostile intruder by a group of mobile agents. We assume that this task is performed in environment which we are able to model as a graph G. The question asked is how many agents are needed to capture an arbitrary fast, invisible and smart intruder. This number is called the (edge) search number of G. The strategy which must be performed by agents is called...
-
A better practical algorithm for distributed graph coloring
Publikacja -
Interval vertex-coloring of a graph with forbidden colors
Publikacja -
Interval Vertex-Coloring of a Graph With Forbidden Colors
Publikacja -
The smallest hard-to-color graph for algorithm DSATUR
Publikacja -
Interval edge coloring of a graph with forbidden colors
Publikacja -
The smallest hard-to-color graph for the SL algorithm
Publikacja -
Parallel tabu search for graph coloring problem
PublikacjaTabu search is a simple, yet powerful meta-heuristic based on local search that has been often used to solve combinatorial optimization problems like the graph coloring problem. This paper presents current taxonomy of patallel tabu search algorithms and compares three parallelization techniques applied to Tabucol, a sequential TS algorithm for graph coloring. The experimental results are based on graphs available from the DIMACS...
-
Graph Approach to the Computation of the Homology of Continuous Maps
Publikacja -
Zero-visibility cops and robber and the pathwidth of a graph
PublikacjaWe examine the zero-visibility cops and robber graph searching model, which differs from the classical cops and robber game in one way: the robber is invisible. We show that this model is not monotonic. We show that the zero-visibility copnumber of a graph is bounded above by its pathwidth and cannot be bounded below by any nontrivial function of the pathwidth. As well, we define a monotonic version of this game and show that the...
-
Product Graph Invariants with Applications in the Theory of Information
PublikacjaThere are a large number of graph invariants. In the paper, we consider some of them, e.g. the independence and chromatic numbers. It is well know that we cannot efficiently calculate these numbers for arbitrary graphs. In the paper we present relations between these invariants and concepts from the theory of information. Concepts such as source coding and transmission over a noisy channel with zero probability of error are modeled...
-
Zero-Visibility Cops and Robber Game on a Graph
PublikacjaWe examine the zero-visibility cops and robber graph searching model, which differs from the classical cops & robber game in one way: the robber is invisible. We show that this model is not monotonic. We also provide bounds on both the zero-visibility copnumber and monotonic zero-visibility copnumber in terms of the pathwidth.
-
Multi-agent graph searching and exploration algorithms
PublikacjaA team of mobile entities, which we refer to as agents or searchers interchangeably, starting from homebases needs to complete a given task in a graph.The goal is to build a strategy, which allows agents to accomplish their task. We analyze strategies for their effectiveness (e.g., the number of used agents, the total number of performed moves by the agents or the completion time).Currently, the fields of on-line (i.e., agents...
-
Weakly convex domination subdivision number of a graph
PublikacjaA set X is weakly convex in G if for any two vertices a; b \in X there exists an ab–geodesic such that all of its vertices belong to X. A set X \subset V is a weakly convex dominating set if X is weakly convex and dominating. The weakly convex domination number \gamma_wcon(G) of a graph G equals the minimum cardinality of a weakly convex dominating set in G. The weakly convex domination subdivision number sd_wcon (G) is the minimum...
-
Efficient parallel query processing by graph ranking
PublikacjaW artykule analizujemy przybliżony algorytm dla problemu szukania drzewa spinającego o minimalnym uporządkowanym indeksie chromatycznym, co znajduje zastosowanie w równoległym przetwarzaniu zapytań w relacyjnych bazach danych. Podajemy nowe oszacowanie uporządkowanego indeksu chromatycznego drzewa, które prowadzi do uzyskania lepszej funkcji dobroci wspomnianego algorytmu.
-
Distributed largest-first algorithm for graph coloring.
PublikacjaW artykule zaprezentowano rozproszony, probabilistyczny algorytm kolorowania grafów. Kolorowanie uzyskane jest optymalne lub prawie optymalne dla takich klas grafów jak koła dwudzielne, gąsienice czy korony. Udowodniono, że algorytm ten działa w czasie O(D^2 log n) rund dla dowolnego grafu n wierzchołkowegoo stopniu maksymalnym D.
-
An experimental study of distributed algorithms for graph coloring.
PublikacjaW pracy podano algorytm rozproszonego kolorowania grafówi porównano ze znanym wcześniej algorytmem.
-
Packing three-vertex paths in a subcubic graph
PublikacjaW pracy rozważany jest problem pakowania scieżek P3 w grafach podkubicznych, pokazano oszacowania dolne na ilość ścieżek w zależności od stopnia spójności grafu oraz minimalnego stopnia.
-
Connection graphs
Publikacja -
International Journal of Combinatorial Graph Theory and Applications
Czasopisma -
Graphs with isolation number equal to one third of the order
PublikacjaA set D of vertices of a graph G is isolating if the set of vertices not in D and with no neighbor in D is independent. The isolation number of G, denoted by \iota(G) , is the minimum cardinality of an isolating set of G. It is known that \iota(G) \leq n/3 , if G is a connected graph of order n, , distinct from C_5 . The main result of this work is the characterisation of unicyclic and block graphs of order n with isolating number...
-
African and Black Diaspora
Czasopisma -
JOURNAL OF BLACK STUDIES
Czasopisma -
Journal of Black Psychology
Czasopisma -
Dataset of non-isomorphic graphs of the coloring types (K4,K4;n), 1<n<R(4,4)
Dane BadawczeFor 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 being coloring types (K5-e,Km-e;n), 2<m<5, 1<n<R(K5-e,Km-e)
Dane BadawczeFor 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)
Dane BadawczeFor 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...
-
Dataset of non-isomorphic graphs of the coloring types (K4,Km-e;n), 2<m<5, 1<n<R(K4,Km-e)
Dane BadawczeFor 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)...
-
Time and clock synchronization with AFCK for CBM
Publikacja -
Dataset of non-isomorphic graphs of the coloring types (Km,K3-e;n), 4<m<8, 1<n<R(Km,K3-e)
Dane BadawczeFor 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)...
-
An influence of the ship's block coefficient implementation on the evaluation of it's hull girder bending
PublikacjaAn influence of the three different ways of implementation ship's block coefficient δ (three geometrical models) on the stresses due to wave bending moment have been investigated. Two models have been applied and compared: beam one (description of the shape usingparameters) and FEM shell model (direct representation of the shape). The outcomes have been compared to Polish Register of Shipping (PRS) rules. The results show that...
-
Exploring the structure–property schemes in anion–π systems of d-block metalates
Publikacja -
Enzymatically catalyzed furan-based copolyesters containing dilinoleic diol as a building block
Publikacja -
Dataset of non-isomorphic graphs of the coloring types (K3,Km;n), 2<m<7, 1<n<R(3,m)
Dane BadawczeFor 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...