Search
displaying 1000 best results Help
Search results for: EXTREMAL 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++....
-
On Applications of Fractional Derivatives in Electromagnetic Theory
PublicationIn this paper, concepts of fractional-order (FO) derivatives are analysed from the point of view of applications in the electromagnetic theory. The mathematical problems related to the FO generalization of Maxwell's equations are investigated. The most popular formulations of the fractional derivatives, i.e., Riemann-Liouville, Caputo, Grünwald-Letnikov and Marchaud definitions, are considered. Properties of these derivatives are...
-
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.
-
Graph models of clos networks
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ń.
-
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...
-
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...
-
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...
-
Scattering Theory Summer School 2022
e-Learning CoursesSummer school on Scattering Theory at Gdańsk University of Technology. 1 - 19 August online 22 - 26 August online or in Gdańsk (you choose) Participation is for free! Attractive fellowships! More info and registration: https://ftims.pg.edu.pl/en/science-app/summer-schools-2022/scattering-theory
-
Module structure in Conley theory with some applications
PublicationA multiplicative structure in the cohomological versjon of Conley index is described . In the case of equivariant flows we apply the normalization procedure known from equivariant degree theory and we propose a new continuation invariant. The theory is then applied to obtain a mountain pass type theorem. Another application is a result on multiple bifurcations for some elliptic PDE.
-
Neural Graph Collaborative Filtering: Analysis of Possibilities on Diverse Datasets
PublicationThis paper continues the work by Wang et al. [17]. Its goal is to verify the robustness of the NGCF (Neural Graph Collaborative Filtering) technique by assessing its ability to generalize across different datasets. To achieve this, we first replicated the experiments conducted by Wang et al. [17] to ensure that their replication package is functional. We received sligthly better results for ndcg@20 and somewhat poorer results for...
-
Wojciech Wojnowski dr inż.
PeopleUkończył V Liceum Ogólnokształcące w Gdańsku w klasie o profilu matematyczno-fizycznym z wykładowym językiem angielskim. W 2009 roku rozpoczął studia na Wydziale Chemicznym PG na kierunku technologia chemiczna, uzyskując w 2012 roku tytuł inżyniera, a w 2013 tytuł magistra. W latach 2013–2015 studiował sinologię na Uniwersytecie w Nankinie dzięki uzyskaniu Stypendium Rządu ChRL. Po powrocie do Polski w 2015 roku rozpoczął studia...
-
Structure of the Resource Theory of Quantum Coherence
PublicationQuantum coherence is an essential feature of quantum mechanics which is responsible for the departure between the classical and quantum world. The recently established resource theory of quantum coherence studies possible quantum technological applications of quantum coherence, and limitations that arise if one is lacking the ability to establish superpositions. An important open problem in this context is a simple characterization...
-
Saint-Venant torsion based on strain gradient theory
PublicationIn this study, the Saint-Venant torsion problem based on strain gradient theory is developed. A total form of Mindlin's strain gradient theory is used to acquire a general Saint-Venant torsion problem of micro-bars formulation. A new Finite Element formulation based on strain gradient elasticity theory is presented to solve the Saint-Venant torsion problem of micro-bars. Moreover, the problem is solved for both micro and macro...
-
Analysis of elementary cellular automata using the theory of conflict
PublicationThe paper contains decomposition of elementary cellular automata (ECA in short) to subsystems that are defined according to a new theory called theory of conflict (ToC in short). The decomposition is a completely new approach to analysis of ECA and complex systems in general.
-
Towards Resource Theory of Coherence in Distributed Scenarios
PublicationThe search for a simple description of fundamental physical processes is an important part of quantum theory. One example for such an abstraction can be found in the distance lab paradigm: if two separated parties are connected via a classical channel, it is notoriously difficult to characterize all possible operations these parties can perform. This class of operations is widely known as local operations and classical communication....
-
Wybrane aspekty i zastosowania modeli zdarzeń ekstremalnych / Selected facets and application of models of extremal events
Publication -
Electromagnetic-based derivation of fractional-order circuit theory
PublicationIn this paper, foundations of the fractional-order circuit theory are revisited. Although many papers have been devoted to fractional-order modelling of electrical circuits, there are relatively few foundations for such an approach. Therefore, we derive fractional-order lumped-element equations for capacitors, inductors and resistors, as well as Kirchhoff’s voltage and current laws using quasi-static approximations of fractional-order...
-
On the effective properties of foams in the framework of the couple stress theory
PublicationIn the framework of the couple stress theory, we discuss the effective elastic properties of a metal open-cell foam. In this theory, we have the couple stress tensor, but the microrotations are fully described by displacements. To this end, we performed calculations for a representative volume element which give the matrices of elastic moduli relating stress and stress tensors with strain and microcurvature tensors.
-
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...
-
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...
-
Spectral splittings in the Conley index theory
Publication -
The outer-connected domination number of a graph
PublicationW pracy została zdefiniowana liczba dominowania zewnętrznie spójnego i przedstawiono jej podstawowe własności.
-
On the total restrained domination number of a graph
PublicationW pracy przedstawione są ograniczenia i własności liczby dominowania podwójnie totalnego.
-
The task graph assignment for KASKADA platform
PublicationArtykuł opisuje model obliczeniowy wykorzystany w platformie KASKADA. Opiera się on na dwóch podstawowych elementach: węzłach klastra obliczeniowego oraz grafie zadań. Przeanalizowane zostały algorytmy przydzielania węzłów obliczeniowych dla zadań w zależności od kryteriów: minimalizacja fragmentacji klastra i minimalizacja opóźnienia przetwarzania danych. Zostały przedstawione wyniki symulacji opisanych algorytmów oraz ich...
-
On greedy graph coloring in the distributed model
PublicationArtykuł 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.
-
On the doubly connected domination number of a graph
PublicationW pracy została zdefiniowana liczba dominowania podwójnie spójnego i przedstawiono jej podstawowe własności.
-
A non-linear direct peridynamics plate theory
PublicationIn this paper a direct non-local peridynamics theory for thin plates is developed. Peridynamic points are assumed to behave like rigid bodies with independent translation and finite rotation degrees of freedom. The non-local mechanical interaction between points is characterized by force and moment vectors. The balance equations including the linear momentum, the angular momentum and the energy are presented. Peridynamic deformation...
-
Theory of systems & cybernetics as a bridge between theory and practice. .
PublicationW pracy przedstawiono sposoby posługiwania się Teorią Systemów i Cybernetyką celem identyfikacji efektu synergii między nauką i działalnością praktyczną.
-
Electro-mechanical shear buckling of piezoelectric nanoplate using modified couple stress theory based on simplified first order shear deformation theory
PublicationThis paper studies the electro-mechanical shear buckling analysis of piezoelectric nanoplate using modified couple stress theory with various boundary conditions.In order to be taken electric effects into account, an external electric voltage is applied on the piezoelectric nanoplate. The simplified first order shear deformation theory (S-FSDT) has been employed and the governing differential equations have been obtained using...
-
On constitutive relations in the resultatnt non-linear theory of shells
PublicationThe authors summarize their current research in the field of constitutive modelling in the framework of non-linear 6-parameter shell theory. In particular the description of isotropic, multilayered composite and functionally graded shells is presented.
-
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph
PublicationA vertex cover of a graph G = (V, E) is a set X ⊂ V such that each edge of G is incident to at least one vertex of X. The ve cardinality of a vertex cover of G. A dominating set D ⊆ V is a weakly connected dominating set of G if the subgraph G[D]w = (N[D], Ew) weakly induced by D, is connected, where Ew is the set of all edges having at least one vertex in D. The weakly connected domination number γw(G) of G is the minimum cardinality...
-
FROM THEORY TO PRACTICE MODERN RESEARCH METHODS AND SCIENTIFIC PROJECTS
PublicationThe book From Theory to Practice: Modern Research Methods and Scientific Projects explores essential strategies and methodologies that bridge academic theory with practical research applications. It offers readers, especially emerging researchers, a clear roadmap through each stage of scientific inquiry, emphasizing project design, data analysis, and ethical considerations for impactful research outcomes.
-
Buckling analysis of piezo-magnetoelectric nanoplates in hygrothermal environment based on a novel one variable plate theory combining with higher-order nonlocal strain gradient theory
PublicationIn the present investigation, a new first-order shear deformation theory (OVFSDT) on the basis of the in-plane stability of the piezo-magnetoelectric composite nanoplate (PMEN) has been developed, and its precision has been evaluated. The OVFSDT has many advantages compared to the conventional first-order shear deformation theory (FSDT) such as needless of shear correction factors, containing less number of unknowns than the existing...
-
Elastoplastic material law in 6-parameter nonlinear shell theory
PublicationWe develop the elastoplastic constitutive relations for nonlinear exact 6-parameter shell theory. A J2-type theory with strain hardening is formulated that takes into account asymmetric membrane strain measures. The incremental equations are solved using implicit Euler scheme with closest point projection algorithm. The presented test example shows the correctness of the proposed approach. Influence of micropolar material parameters...
-
On Applications of Elements Modelled by Fractional Derivatives in Circuit Theory
PublicationIn this paper, concepts of fractional-order (FO) derivatives are reviewed and discussed with regard to element models applied in the circuit theory. The properties of FO derivatives required for the circuit-level modeling are formulated. Potential problems related to the generalization of transmission-line equations with the use of FO derivatives are presented. It is demonstrated that some formulations of FO derivatives have limited...
-
Piotr Samól dr hab. inż. arch.
PeoplePiotr Samól is an associate professor (profesor uczelni) in the Department of History, Theory and Monument Preservation at Gdansk University of Technology. He graduated in architecture (M.Sc. Eng.) and history (B.A.). His researches are focused on the architectural and urban history of Gdansk and Baltic Sea region. He defended his doctoral thesis (scientifc field: architecture and urban planning) on the architecture of Dominican...
-
Facing the brainstorming theory. A case of requirements elicitation
PublicationKnowledge is still considered to be power and its externalization makes it possible for others to use that power. In this paper, we examine the theory of brainstorming, and the claim by father Alex Osborn that in a group session an individual can think of twice as many ideas than working alone. In the context of requirements elicitation, we performed an experiment on a “nominal” and a “real” group of participants, following a procedure...
-
From fluid mechanics backgrounds to modern field theory
PublicationOur presentation keeps a historical line of reasoning, since we start from old concepts of fluid mechanics and finish on concepts of modern field theory. We want to show that some facts from the nature phenomena, which have firstly been discovered on the ground of fluid mechanics, were next incorporated into physics and later become the important pattern for whole mathematical physics. Especially, well-known continuum models, which...
-
Graph Approach to the Computation of the Homology of Continuous Maps
Publication -
Graph decomposition for improving memoryless periodic exploration
PublicationW 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.
-
A better practical algorithm for distributed graph coloring
Publication -
Interval vertex-coloring of a graph with forbidden colors
Publication -
Interval Vertex-Coloring of a Graph With Forbidden Colors
Publication -
The smallest hard-to-color graph for algorithm DSATUR
Publication -
Interval edge coloring of a graph with forbidden colors
Publication -
The smallest hard-to-color graph for the SL algorithm
Publication -
Packing three-vertex paths in a subcubic graph
PublicationW 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.
-
Efficient parallel query processing by graph ranking
PublicationW 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.
PublicationW 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.