Filters
total: 10465
-
Catalog
- Publications 5715 available results
- Journals 17 available results
- Conferences 23 available results
- People 138 available results
- Inventions 10 available results
- Projects 4 available results
- Laboratories 6 available results
- Research Teams 7 available results
- Research Equipment 40 available results
- e-Learning Courses 1151 available results
- Events 24 available results
- Open Research Data 3330 available results
displaying 1000 best results Help
Search results for: chromatic cost coloring, optimum cost chromatic partition, weighted graph, bipartite graph, approximation algorithm, chromatic cost 3-pseudocoloring
-
PUBLIC GOODS VERSUS THE FARM PRICE-COST SQUEEZE: SHAPING THE SUSTAINABILITY OF THE EU’S COMMON AGRICULTURAL POLICY
Publication -
The cost minimizing solution of the transportation problem for the location of the building machinery yard along the road under construction
Publication -
Finding the Right Solvent: A Novel Screening Protocol for Identifying Environmentally Friendly and Cost-Effective Options for Benzenesulfonamide
PublicationThis study investigated the solubility of benzenesulfonamide (BSA) as a model compound using experimental and computational methods. New experimental solubility data were collected in the solvents DMSO, DMF, 4FM, and their binary mixtures with water. The predictive model was constructed based on the best-performing regression models trained on available experimental data, and their hyperparameters were optimized using a newly...
-
Dataset of non-isomorphic graphs of the coloring types (Km,K3-e;n), 4<m<8, 1<n<R(Km,K3-e)
Open Research DataFor 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)...
-
Nordhaus-Gaddum results for the convex domination number of a graph
PublicationPraca dotyczy nierówności typu Nordhausa-Gadduma dla dominowania wypukłego.
-
Kolorowanie grafów z ograniczeniami na liczbę wierzchołków w określonym kolorze = Graph coloring model with restrictions on cardinalities of vertexes in particular color
PublicationW artykule rozważamy problem takiego kolorowania grafów, w którym klasy kolorów mają ograniczoną z góry moc. Zagadnie to znajduje ciekawe zastosowania praktyczne i jest naturalnym uogólnieniem problemu kolorowania grafów. W artykule ustalamy złożoność obliczeniową dla grafów pełnych $r$-dzielnych i dla kilku innych prostych klas grafów oraz dla problemu dwukolorowania.
-
Dataset of non-isomorphic graphs being coloring types (K3-e,Km-e;n), 2<m<8, 1<n<R(K3-e,Km-e)
Open Research DataFor K3-e and Km-e graphs, the type coloring (K3-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K3-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(K3-e,Km-e) is the smallest...
-
Uniform expansion estimates in the quadratic map as a function of the partition size, using the Floyd–Warshall algorithm
Open Research DataThis dataset contains selected results of numerical computations described in the paper "Quantitative hyperbolicity estimates in one-dimensional dynamics" by S. Day, H. Kokubu, S. Luzzatto, K. Mischaikow, H. Oka, P. Pilarczyk, published in Nonlinearity, Vol. 21, No. 9 (2008), 1967-1987, doi: 10.1088/0951-7715/21/9/002.
-
Switched-capacitor DC-DC converters in arbitrary switching mode - topologically derived resistive models based on incremental graph approach.
PublicationIn the preceding paper we reviewed some of modeling approaches aimed at systematic formulation and solution of switched capacitor DC-DC converters. In our review, special attention was paid to computationally efficient and mathematically elegant methods. In so doing we had tried to demonstrate the virtues of unified Incremental Graph (IG) approach. Incremental Graph is, in concept, a tool originally created for analysis and synthesis...
-
Equitable coloring of hypergraphs
PublicationA hypergraph is equitablyk-colorable if its vertices can be partitioned into k sets/colorclasses in such a way that monochromatic edges are avoided and the number of verticesin any two color classes differs by at most one. We prove that the problem of equitable 2-coloring of hypergraphs is NP-complete even for 3-uniform hyperstars. Finally, we apply the method of dynamic programming for designing a polynomial-time algorithm to...
-
Dataset of non-isomorphic graphs being coloring types (K5-e,Km-e;n), 2<m<5, 1<n<R(K5-e,Km-e)
Open Research DataFor 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)
Open Research DataFor 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 being coloring types (K4-e,Km-e;n), 2<m<7, 1<n<R(K4-e,Km-e)
Open Research DataFor K4-e and Km-e graphs, the type coloring (K4-e,Km-e;n) is such an edge coloring of the full Kn graph, which does not have the K4-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(K4-e,Km-e) is the smallest...
-
Rendezvous of heterogeneous mobile agents in edge-weighted networks
PublicationWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
Rendezvous of Heterogeneous Mobile Agents in Edge-Weighted Networks
PublicationWe introduce a variant of the deterministic rendezvous problem for a pair of heterogeneous agents operating in an undirected graph, which differ in the time they require to traverse particular edges of the graph. Each agent knows the complete topology of the graph and the initial positions of both agents. The agent also knows its own traversal times for all of the edges of the graph, but is unaware of the corresponding traversal...
-
Generalized Gradient Equivariant Multivalued Maps, Approximation and Degree
PublicationConsider the Euclidean space Rn with the orthogonal action of a compact Lie group G. We prove that a locally Lipschitz G-invariant mapping f from Rn to R can be uniformly approximated by G-invariant smooth mappings g in such a way that the gradient of g is a graph approximation of Clarke’s generalized gradient of f . This result enables a proper development of equivariant gradient degree theory for a class of set-valued gradient...
-
Large-Scale and Low-Cost Motivation of Nitrogen-Doped Commercial Activated Carbon for High-Energy-Density Supercapacitor
Publication -
Accelerated senescence as a cost of reproduction: Testing associations between oxidative stress and reproductive effort in rural and urban women
Publication -
Low-cost Adsorbents Derived from Agricultural By-products/Wastes for Enhancing Contaminant Uptakes from Wastewater: A Review
PublicationA major threat to the comfort of human life has been imposed by increased industrialization and urbanization. The generation and disposal of huge amounts of toxic materials and pollutants have heavily contaminated our environment. Some Organics such as synthetic dyes (SD) and heavy metals (HM) are becoming increasingly prevalent as the most dangerous pollutants in soil and surface water environments. They are...
-
Reliable low-cost surrogate modeling and design optimisation of antennas using implicit space mapping with substrate segmentation
PublicationAbstract: In this work, a reliable methodology for fast simulation-driven design optimisation of antenna structures is proposed. The authors’ approach exploits implicit space mapping (ISM) technology. To adopt it for handling antenna structures, they introduce substrate segmentation with separate dielectric permittivity value assigned for each segment as ISM preassigned parameters. At the same time, the coarse model for space mapping...
-
Cost of Equity of Coal-Fired Power Generation Projects in Poland: Its Importance for the Management of Decision-Making Process
Publication -
Elastic multi-layer resilient IP-over-Flexgrid networking: Detailed cost analysis with bandwidth-variable transponders
Publication -
Circular polarization diversity implementation for correlation reduction in wideband low-cost multiple-input-multiple-output antenna
PublicationIn this paper, a multiple-input-multiple-output (MIMO) antenna featuring circular polarization diversity, and designed on a common coplanar ground is presented. The proposed antenna design utilizes a coplanar waveguide (CPW) feeding technique with three parallel coplanar ground planes, and two feedlines in-between. For circular polarization (CP), quasi-loops are created by etching slots on the outermost ground planes. With this...
-
Assessment of the Steering Precision of a Hydrographic Unmanned Surface Vessel (USV) along Sounding Profiles Using a Low-Cost Multi-Global Navigation Satellite System (GNSS) Receiver Supported Autopilot
Publicationhe performance of bathymetric measurements by traditional methods (using manned vessels) in ultra-shallow waters, i.e., lakes, rivers, and sea beaches with a depth of less than 1 m, is often difficult or, in many cases, impossible due to problems related to safe vessel maneuvering. For this reason, the use of shallow draft hydrographic Unmanned Surface Vessels (USV) appears to provide a promising alternative method for performing...
-
Exploiting multi-interface networks: Connectivity and Cheapest Paths
PublicationLet G = (V,E) be a graph which models a set of wireless devices (nodes V) that can communicate by means of multiple radio interfaces, according to proximity and common interfaces (edges E). The problem of switching on (activating) the minimum cost set of interfaces at the nodes in order to guarantee the coverage of G was recently studied. A connection is covered (activated) when the endpoints of the corresponding edge share at...
-
Comparison of hydrogen bonds and diverse weak interactions of the nitro group in 2-methyl-4-nitroanilinium nitrate, bisulfate and two hexafluoridosilicates: elementary graph-set approach
PublicationCrystal structures of (H2m4na)NO3 (1), (H2m4na)HSO4 (2), (H2m4na)2SiF6 (3) and (H2m4na)2SiF6*2H2O (4), where 2m4na = 2-methyl-4-nitroaniline, are presented. Two layers of interactions occur in the structures, N—H...O/F hydrogen bonds and interactions with the nitro group. Although diverse, hydrogen-bonding patterns are compared with each other by means of interrelations among elementary graph-set descriptors and descriptors of hydrogen-bonding...
-
Self-stabilizing algorithm for edge-coloring of graphs
PublicationReferat ten poświęcony jest kolorowaniu grafów w modelu rozproszonym.Podano samostabilizujący się algorytm kolorowania krawędzi grafu wraz z dowodem poprawności oraz oszacowaniem jego czasu działania.
-
Neural Graph Collaborative Filtering: Analysis of Possibilities on Diverse Datasets
Publication -
Modelling of energy flow in electrical machines. A bond graph approach
PublicationPrzedstawiono w ujęcia grafów wiązań model przepływu energii/mocy w maszynach elektrycznych pracujących w hybrydowych systemach przetwarzania energii. Jako przykład do rozważań przyjęto system napędu trakcyjnego pojazdów hybrydowych.
-
Towards explainable motion prediction using heterogeneous graph representations
Publication -
Tighter bounds on the size of a maximum P3-matching in a cubic graph
PublicationW pracy pokazano, że największe P3-skojarzenie dla dowolnego grafu o n>16 wierzchołkach składa się z przynajmniej 117n/152 wierzchołków.
-
An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems
Publication -
On some Zarankiewicz numbers and bipartite Ramsey Numbers for Quadrilateral
PublicationThe Zarankiewicz number z ( m, n ; s, t ) is the maximum number of edges in a subgraph of K m,n that does not contain K s,t as a subgraph. The bipartite Ramsey number b ( n 1 , · · · , n k ) is the least positive integer b such that any coloring of the edges of K b,b with k colors will result in a monochromatic copy of K n i ,n i in the i -th color, for some i , 1 ≤ i ≤ k . If n i = m for all i , then we denote this number by b k ( m )....
-
Neural Network-Based Sequential Global Sensitivity Analysis Algorithm
PublicationPerforming global sensitivity analysis (GSA) can be challenging due to the combined effect of the high computational cost, but it is also essential for engineering decision making. To reduce this cost, surrogate modeling such as neural networks (NNs) are used to replace the expensive simulation model in the GSA process, which introduces the additional challenge of finding the minimum number of training data samples required to...
-
International Journal of Combinatorial Graph Theory and Applications
Journals -
Evidence for the Cost of Reproduction in Humans: High Lifetime Reproductive Effort Is Associated with Greater Oxidative Stress in Post-Menopausal Women
Publication -
Application of low-cost Gallium Arsenide light-emitting-diodes as kerma dosemeter and fluence monitor for high-energy neutrons
Publication -
New potential functions for greedy independence and coloring
PublicationA potential function $f_G$ of a finite, simple and undirected graph $G=(V,E)$ is an arbitrary function $f_G : V(G) \rightarrow \mathbb{N}_0$ that assigns a nonnegative integer to every vertex of a graph $G$. In this paper we define the iterative process of computing the step potential function $q_G$ such that $q_G(v)\leq d_G(v)$ for all $v\in V(G)$. We use this function in the development of new Caro-Wei-type and Brooks-type...
-
Joanna Raczek dr inż.
PeopleEmployment 2003 -- 2019: Faculty of Applied Physics and Mathematics, Gdańsk University of Technology. 2019 - present: Faculty of Electronic, Informatics and Telecominications, Gdańsk University of Technology. Education May 2007: Doctor of Philosophy in Mathematics, University of Gdańsk. Doctoral dissertation: "Paired domination and doubly domination in graphs". Supervisor: dr hab. Jerzy Topp. 2000 -- 2004 Bachelor of Science...
-
Anna Zielińska-Jurek prof. dr hab. inż.
People2018 DSc in technical sciences in the field of chemical technology Chemical Faculty, Gdansk University of Technology, Title: “Functionalized titanium(IV) oxide as a photocatalyst for environmental purification” 2011 Ph. D. in technical sciences in the field of chemical technology Chemical Faculty, Gdansk University of Technology, Title of the dissertation:...
-
Tomasz Wąsowicz dr hab.
PeopleTomasz Wąsowicz's research was first related to high-resolution atomic spectroscopy and focused on measurements and analysis of the transition probabilities of the forbidden lines, the hyperfine and isotopic structure of spectral lines of heavy elements, Stark effect in the helium atom. Tomasz Wąsowicz currently studies physicochemical processes occurring during interactions of various forms of radiation with atoms and molecules...
-
Better polynomial algorithms for scheduling unit-length jobs with bipartite incompatibility graphs on uniform machines
PublicationThe goal of this paper is to explore and to provide tools for the investigation of the problems of unit-length scheduling of incompatible jobs on uniform machines. We present two new algorithms that are a significant improvement over the known algorithms. The first one is Algorithm 2 which is 2-approximate for the problem Qm|p j = 1, G = bisubquartic|Cmax . The second one is Algorithm 3 which is 4-approximate for the problem Qm|p...
-
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...
-
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...
-
A linear time algorithm for edge coloring of binomial trees
Publication -
Calculating the Partition Coefficients of Organic Solvents in Octanol/Water and Octanol/Air
PublicationPartition coefficients define how a solute is distributed between two immiscible phases at equilibrium. The experimental estimation of partition coefficients in a complex system can be an expensive, difficult, and time-consuming process. Here a computational strategy to predict the distributions of a set of solutes in two relevant phase equilibria is presented. The octanol/water and octanol/air partition coefficients are predicted...
-
Selecting the optimum location for logistics facilities using Solver
PublicationSiting logistics facilities strategically in the most costeffective geographic location is one of the key decisions a contemporary company will make. The aim of the paper is to present a solution to this problem using the Solver add-on. In the case study discussed in the paper, the company’s central warehouse location was selected based on the classic location theory, which addresses the need to minimize the cost of transport....
-
Costs and cost‐effectiveness of the meeting centres support programme for people living with dementia and carers in Italy, Poland and the UK: The MEETINGDEM study
Publication -
Recent progress in research on the cutting processes of wood. A review COST Action E35 2004–2008: Wood machining – micromechanics and fracture
Publication -
Effective calcium doping at the B-site of BaFeO3−δ perovskite: towards low-cost and high-performance oxygen permeation membranes
Publication