Filters
total: 2167
-
Catalog
displaying 1000 best results Help
Search results for: RANDOM GRAPHS
-
Weakly convex and convex domination numbers of some products of graphs
PublicationIf $G=(V,E)$ is a simple connected graph and $a,b\in V$, then a shortest $(a-b)$ path is called a $(u-v)$-{\it geodesic}. A set $X\subseteq V$ is called {\it weakly convex} in $G$ if for every two vertices $a,b\in X$ exists $(a-b)$- geodesic whose all vertices belong to $X$. A set $X$ is {\it convex} in $G$ if for every $a,b\in X$ all vertices from every $(a-b)$-geodesic belong to $X$. The {\it weakly convex domination number}...
-
Modelling and analysis of beam/bar structure by application of bond graphs
PublicationThe paper presents an uniform, port-based approach to modelling of beam/bar systems (trusses). Port-based model of such distributed parameter system has been defined by application of the bond graph methodology and the distributed transfer function method (DTFM). The proposed method of modelling enables to formulate input data for computer analysis by application of the DTFM. The constructed computational package enables the frequency...
-
Equitable colorings of some variation of corona products of cubic graphs
PublicationThe problem of determining the value of equitable chromatic number for multicoronas of cubic graphs is studied. We provide some polynomially solvable cases of cubical multicoronas and give simple linear time algorithms for equitable coloring of such graphs which use almost optimal number of colors in the remaining cases.
-
On incidence coloring of coloring of complete multipartite and semicubic bipartite graphs
PublicationIn the paper, we show that the incidence chromatic number of a complete k-partite graph is at most ∆+2 (i.e., proving the incidence coloring conjecture for these graphs) and it is equal to ∆+1 if and only if the smallest part has only one vertex.
-
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...
-
Quantum strategies for rendezvous and domination tasks on graphs with mobile agents
PublicationThis paper explores the application of quantum nonlocality, a renowned and unique phenomenon acknowledged as a valuable resource. Focusing on an alternative application, we demonstrate its quantum advantage for mobile agents engaged in specific distributed tasks without communication. The research addresses the significant challenge of rendezvous on graphs and introduces a distributed task for mobile agents grounded in the graph...
-
SCRAMBLE’N’GAMBLE: a tool for fast and facile generation of random data for statistical evaluation of QSAR models
Publication -
The Effect of the Selection of Three-Dimensional Random Numerical Soil Models on Strip Foundation Settlements
PublicationThis paper delivers a probabilistic attempt to prove that the selection of a random three-dimensional finite element (FE) model of a subsoil affects the computed settlements. Parametricanalysis of a random soil block is conducted, assuming a variable subsoil Young’s modulus inparticular finite elements. The modulus is represented by a random field or different-sized setsof random variables; in both cases, the same truncated...
-
FPGA-Based System for Electromagnetic Interference Evaluation in Random Modulated DC/DC Converters
PublicationField-Programmable Gate Array (FPGA) provides the possibility to design new “electromagnetic compatibility (EMC) friendly” control techniques for power electronic converters. Such control techniques use pseudo-random modulators (RanM) to control the converter switches. However, some issues connected with the FPGA-based design of RanM, such as matching the range of fixed-point numbers, might be challenging. The modern programming...
-
Simulating propagation of coherent light in random media using the Fredholm type integral equation
PublicationStudying propagation of light in random scattering materials is important for both basic and applied research. Such studies often require usage of numerical method for simulating behavior of light beams in random media. However, if such simulations require consideration of coherence properties of light, they may become a complex numerical problems. There are well established methods for simulating multiple scattering of light (e.g....
-
Development of Local IDF-formula Using Controlled Random Search Method for Global Optimization
PublicationThe aim of the study is to present the effective and relatively simple empirical approach to rainfall Intensity-Duration-Frequency-formulas development, based on Controlled Random Search (CRS) for global optimization. The approach is mainly dedicated to the cases in which the commonly used IDF-relationships do not provide satisfactory fit between simulations and observations, and more complex formulas with higher number of parameters...
-
Controlled Random Search Applied to Parameters Estimation of the Longitudinal Solutes Transport Model for Rivers
PublicationNumerical computations are presented for the longitudinal transport of passive, conservative solutes in an actual river with the inclusion of geometrical complexities of river channels. A special emphasis is put on the method of the identification of model parameters which is based on a specially designed optimisation procedure using random control search algorithm. Two different situations are considered namely a linear version...
-
Random components influence on the values characterising periodic disturbances in low voltage supply lines.
PublicationAnalizowano wpływ składowych losowych na wielkości charakteryzujących zaburzenia okresowe w napięciu zasilania na przykładzie współczynnika zawartości harmonicznych (THD). Zaprezentowano sposób wyznaczania niepewności pomiaru współczynnika THD, uwzględniający występowanie korelacji pomiędzy składową podstawową i kolejnymi harmonicznymi napięcia sieci a także między poszczególnymi harmonicznymi. Przedstawiono analizę wyników z pomiarów...
-
Spectral criterion for high-cycle fatigue of anisotropic metals under multiaxial random loads
PublicationPraca dotyczy oceny ograniczonej trwałości zmęczeniowej metali ciągliwych, poddanych wieloosiowym obciążeniom statycznym i dynamicznym. Zakłada się, że kartezjańskie składowe tensora naprężenia są sumą losowych wartości średnich o znanych drugich momentach statystycznych i stacjonarnych procesów stochastycznych o znanych gęstościach widmowych mocy. Przyjmując, że procesy te są stacjonarnie skorelowane, różniczkowalne w sensie średnio-kwadratowym...
-
The development of the 3D printing technology in the Radom region
Publication -
Load testing of a suspended footbridge in Radom (Poland)
PublicationThe footbridge in Radom is a suspended bridge of an interesting architectural form. The structure was de-signed for 4 kN/m2 of crowd loading. Dynamic calculations were not included in the design. The structure’s acceptance tests took place on the 14th of October 2016. The behaviour of the footbridge in static testing met the expectations. Unfortunately, as a result of dynamic tests, dangerous behaviour of the footbridge was revealed....
-
Workshop on Graph Theory
EventsThe Gdańsk Workshop on Graph Theory (GWGT) is an annual, informal workshop whose goal is to provide a forum for scientists to meet, present their work, interact, and establish collaborations in the field of Graph Theory
-
Koala graph coloring library: an open graph coloring library for real-world applications
PublicationPomimo intensywnej pracy naukowej na polu kolorowania grafów, nie jest znana kompletna i dedykowana biblioteka programistyczna. Celem artykułu jest zaproponowanie architektury takiej biblioteki. Celem jest spełnienie oczekiwań wypływających z rzeczywistych zastosowań, w szczególności spełnienie potrzeb wydajnościowych. Zaimplementowano szereg algorytmów cheurystycznego kolorowania grafów. Przyjętym językiem programowania jest C++....
-
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...
-
Forwarding and optical indices of a graph
PublicationW pracy rozstrzygnięto dwa problemy dotyczące komunikacji wszyscy-do-wszystkich w grafach. Stwierdzono, że dla wersji skierowanej problemu parametry ''pi'' (maksymalne obciążenie krawędzi) i ''w'' (parametr chromatyczny) nie muszą być w ogólności sobie równe. Dla wersji nieskierowanej problemu pokazano, że wyznaczenie wartości zarówno ''pi'', jak i ''w'', jest w ogólności problemem NP-trudnym.
-
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ń.
-
Graph models of clos networks
Publication...
-
Graph classes generated by Mycielskians
PublicationIn this paper we use the classical notion of weak Mycielskian M'(G) of a graph G and the following sequence: M'_{0}(G) =G, M'_{1}(G)=M'(G), and M'_{n}(G)=M'(M'_{n−1}(G)), to show that if G is a complete graph oforder p, then the above sequence is a generator of the class of p-colorable graphs. Similarly, using Mycielskian M(G) we show that analogously defined sequence is a generator of the class consisting of graphs for which the...
-
Fast collaborative graph exploration
PublicationWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Interval incidence graph coloring
PublicationIn this paper we introduce a concept of interval incidence coloring of graphs and survey its general properties including lower and upper bounds on the number of colors. Our main focus is to determine the exact value of the interval incidence coloring number χii for selected classes of graphs, i.e. paths, cycles, stars, wheels, fans, necklaces, complete graphs and complete k-partite graphs. We also study the complexity of the...
-
Fast Collaborative Graph Exploration
PublicationWe study the following scenario of online graph exploration. A team of k agents is initially located at a distinguished vertex r of an undirected graph. At every time step, each agent can traverse an edge of the graph. All vertices have unique identifiers, and upon entering a vertex, an agent obtains the list of identifiers of all its neighbors. We ask how many time steps are required to complete exploration, i.e., to make sure...
-
Zgred - Zgred Graph Editor
PublicationThe paper presents a graph editor that was developed as a supplementary tool for the Koala graph library. We discuss its requirements, design choices and main ideas behind the implementation. The later part of the paper is meant to be a brief user manual, as we go through the functionality provided by the editor
-
On a Recurrence Arising in Graph Compression
PublicationIn a recently proposed graphical compression algorithm by Choi and Szpankowski (2012), the following tree arose in the course of the analysis. The root contains n balls that are consequently distributed between two subtrees according to a simple rule: In each step, all balls independently move down to the left subtree (say with probability p) or the right subtree (with probability 1p). A new node is created as long as...
-
Parallel scheduling by graph ranking
PublicationNr dokum.: 73017Praca dotyczy jednego z nieklasycznych modeli kolorowania grafów - uporządkowanego kolorowania. Celem było uzyskanie wyników, które mogo być wykorzystane w praktycznych zastosowaniach tego modelu, do których należą: równoległe przetwarzanie zapytań w relacyjnych bazach danych, równoległa faktoryzacja macierzy metodą Choleskiego, równoległa asemblacja produktu z jego części składowych. W pracy wskazano uogólnienia...
-
JOURNAL OF MOLECULAR GRAPHICS & MODELLING
Journals -
Estimation and Prediction of Vertical Deformations of Random Surfaces, Applying the Total Least Squares Collocation Method
PublicationThis paper proposes a method for determining the vertical deformations treated as random fields. It is assumed that the monitored surfaces are subject not only to deterministic deformations, but also to random fluctuations. Furthermore, the existence of random noise coming from surface’s vibrations is also assumed. Such noise disturbs the deformation’s functional models. Surface monitoring with the use of the geodetic levelling...
-
Eye Blink Based Detection of Liveness in Biometric Authentication Systems Using Conditional Random Fields
PublicationThe goal of this paper was to verify whether the conditional random fields are suitable and enough efficient for eye blink detection in user authentication systems based on face recognition with a standard web camera. To evaluate this approach several experiments were carried on using a specially developed test application and video database.
-
Increased Certification of Semi-device Independent Random Numbers using Many Inputs and More Postprocessing
PublicationQuantum communication with systems of dimension larger than two provides advantages in information processing tasks. Examples include higher rates of key distribution and random number generation. The main disadvantage of using such multi-dimensional quantum systems is the increased complexity of the experimental setup. Here, we analyze a not-so-obvious problem: the relation between randomness certification and computational requirements...
-
Spectral criterion of infinite fatigue life of machinery parts under multi-axial random loading
PublicationPrzedstawiono kryterium nieograniczonej trwałości zmęczeniowej metalowych elementów poddanych wieloosiowym losowym drganiom. W celu jego wyznaczenia zastosowano hipotezę energii odkształcenia postaciowego i równanie Goodmana/Soderberga. Traktując gęstości widmowe mocy składowych naprężenia jako znane, kryterium to sformułowano w dziedzinie częstości. W przykładzie obliczeniowym rozpatrzono okresowy w sensie średniokwadratowym stan...
-
Fatigue ''safe-life'' criterion for metal elements under multiaxial static and dynamic random loads.
PublicationRozpatrywane jest stacjonarne naprężenie, którego kartezjańskie składowe są zadane w postaci sumy losowej wartości średniej i procesu stochastycznego o znanych charakterystykach probabilistycznych. Dla uwzględnienia naprężenia średniego wykorzystano uogólnioną formułę Soderberga dla materiałów ciągliwych. Zdefiniowano naprężenie równoważne o okresowych (w sensie średniokwadratowym) składowych i sformułowano kryterium zmęczenia,...
-
A random field-based simulational identification of possible levels of material imperfections of adhesive-bonded joints
PublicationRecently, structural adhesives have become significant in the shaping of structural elements, especially in thin-walled structures, where they replace or supplement traditional connection methods. However, adhesive-bonded joints are highly susceptible to internal structural imperfections due to their application technique and the nature of the adhesive. These material inconsistencies impact the strength parameters and the mechanical...
-
Spam classification methods besed on users e-mail communication graphs
PublicationW artykule poddano analizie grafy zbudowane w oparciu o logi serwerów pocztowych. Węzły grafów reprezentują nadawców i odbiorców wiadomości e-mail natomiast krawędzie przedstawiają procesy wymiany wiadomości e-mail. Analiza grafów pozwala na znalezienie korelacji pomiędzy topologią grafów a relacjami pomiędzy użytkownikami serwisu pocztowego. W oparciu o te relacje zaproponowano algorytm klasyfikujący wymieniane wiadomości e-mail...
-
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
Publication -
Efficient List Cost Coloring of Vertices and∕or Edges of Some Sparse Graphs
Publication -
Equitable Coloring of Graphs. Recent Theoretical Results and New Practical Algorithms
Publication -
Efficient list cost coloring of vertices and/or edges of some sparse graphs
PublicationRozważane jest kolorowanie wierzchołków i krawędzi grafów w modelach klasycznym, totalnym i pseudototalnym z uwzględnieniem dodatkowego ograniczenia w postaci list dostępnych kolorów. Proponujemy wielomianowy algorytm oparty na paradygmacie programowania dynamicznego dla grafów o strukturze drzewa. Wynik ten można uogólnić na grafy o liczbie cyklomatycznej ograniczonej z góry przez dowolnie wybraną stała.
-
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.
-
All graphs with paired-domination number two less than their order
PublicationLet G=(V,E) be a graph with no isolated vertices. A set S⊆V is a paired-dominating set of G if every vertex not in S is adjacent with some vertex in S and the subgraph induced by S contains a perfect matching. The paired-domination number γp(G) of G is defined to be the minimum cardinality of a paired-dominating set of G. Let G be a graph of order n. In [Paired-domination in graphs, Networks 32 (1998), 199-206] Haynes and Slater...
-
A note on polynomial algorithm for cost coloring of bipartite graphs with Δ ≤ 4
PublicationIn the note we consider vertex coloring of a graph in which each color has an associated cost which is incurred each time the color is assigned to a vertex. The cost of coloring is the sum of costs incurred at each vertex. We show that the minimum cost coloring problem for n-vertex bipartite graph of degree ∆≤4 can be solved in O(n^2) time. This extends Jansen’s result [K.Jansen,The optimum cost chromatic partition problem, in:...
-
Efficient list cost coloring of vertices and/or edges of bounded cyclicity graphs
PublicationW artykule rozważamy listowo-kosztowe kolorowanie wierzchołków i krawędzi grafu w modelu wierzchołkowym, krawędziowym, totalnym i pseudototalnym. Stosujemy programowanie dynamiczne w celu otrzymania algorytmów wielomianowych dla drzew. Następnie uogólniamy to podejście na dowolne grafy z ograniczonymi liczbami cyklomatycznymi i na ich multikolorowania.
-
All graphs with restrained domination number three less than their order
PublicationW pracy opisana jest rodzina wszystkich grafów, dla których liczbadominowania zewnętrznego jest o trzy mniejsza od ich rzędu.
-
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...
-
On Optimal Backbone Coloring of Split and Threshold Graphs with Pairwise Disjoint Stars
Publication -
Unicyclic graphs with equal total and total outer-connected domination numbers
PublicationLet G = (V,E) be a graph without an isolated vertex. A set D ⊆ V (G) is a total dominating set if D is dominating and the in- duced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total domi- nating set of G. A set D ⊆ V (G) is a total outer–connected dominating set if D is total dominating and the induced subgraph G[V (G)−D] is a connected graph. The total outer–connected...
-
Modelling electrical machines using bond graphs for mechatronics system applications.
PublicationW artykule przedstawiono modelowanie maszyn elektrycznych metodą grafów wiązań dla potrzeb mechatroniki. Omówiono ogólne założenia modelowania maszyn elektrycznych w ujęciu grafów wiązań, bazującego na modelach wzorcowego sprzężenia transformatorowego i elektromechanicznego. Wykorzystując modele tych sprzężeń przedstawiono w ujęciu grafów wiązań model maszyny indukcyjnej w układzie współrzędnych naturalnych stojana. Model opracowano...