displaying 1000 best results Help
Search results for: extremal graph theory
-
Karolina Zielińska-Dąbkowska dr inż. arch.
PeopleKarolina M. Zielinska-Dabkowska, Ph.D., Eng. Arch., M. Arch., is an Assistant Professor at the Faculty of Architecture of Gdańsk University of Technology (GUT). In 2002, she completed her studies of Architecture and Urban Planning at Gdańsk University of Technology (Gdańsk Tech) and in 2004, Architectural Engineering at the University of Applied Sciences and Arts (HAWK) in Hildesheim, Germany. After graduation, she worked for several...
-
Monotone iterative method for first-order differential equations at resonance
PublicationThis paper concerns the application of the monotone iterative technique for first-order differential equations involving Stieltjes integrals conditions. We discuss such problems at resonance when the measure in the Stieltjes integral is positive and also when this measure changes the sign. Sufficient conditions which guarantee the existence of extremal, unique and quasi-solutions are given. Three examples illustrate the results.
-
Krzysztof Goczyła prof. dr hab. inż.
PeopleKrzysztof Goczyła, full professor of Gdańsk University of Technology, computer scientist, a specialist in software engineering, knowledge engineering and databases. He graduated from the Faculty of Electronics Technical University of Gdansk in 1976 with a degree in electronic engineering, specializing in automation. Since then he has been working at Gdańsk University of Technology. In 1982 he obtained a doctorate in computer science...
-
Możliwość oszacowania niezawodności silników o zapłonie samoczynnym z zastosowaniem teorii procesów semi-Markowa oraz podejmowania decyzji eksploatacyjnych z uwzględnieniem wiarygodności diagnozy o stanie technicznym tego rodzaju silników spalinowych = Possibility of estimating the reliability of diesel engines by applying the theory of semi-Markov processes and making operational decisions by considering reliability of diagnosis on technical state of this sort of combustion engines/
PublicationThe paper presents semi-Markov models of technical state transitions for diesel engines, useful for determining reliability of the engines. A possibility of application of a three-state model with a simplified matrix function, or even a two-state model, to determine reliability of the engines, has been described herein on examples of known from literature semi-Markov models, for the case when appropriate diagnosing systems (SDG)...
-
IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications
Journals -
New Writing-The International Journal for the Practice and Theory of Creative Writing
Journals -
Labyrinth: An International Journal for Philosophy, Value Theory, and Sociocultural Hermeneutics
Journals -
Politeia-Journal of Political Theory Political Philosophy and Sociology of Politics
Journals -
Monotone iterative method to second order differential equations with deviating arguments involving Stieltjes integral boundary conditions
PublicationWe use a monotone iterative method for second order differential equations with deviating arguments and boundary conditions involving Stieltjes integrals. We establish sufficient conditions which guarantee that such problems have extremal solutions in the corresponding region bounded by lower and upper solutions. We also discuss the situation when problems have coupled quasi-solutions. We illustrate our results by three examples.
-
Research on Enterprise in Modern Economy - theory and practice
Journals -
Quantum entanglement
PublicationAll our former experience with application of quantum theory seems to say that what is predicted by quantum formalism must occur in the laboratory. But the essence of quantum formalism-entanglement, recognized by Einstein, Podolsky, Rosen, and Schrödinger-waited over 70 years to enter laboratories as a new resource as real as energy. This holistic property of compound quantum systems, which involves nonclassical correlations between...
-
First-order differential equations with nonlocal boundary conditions
PublicationWe study a first-order boundary value problem subject to some boundary conditions given by Riemann-Stieltjes integrals. Using a monotone iterative method, we formulate sufficient conditions which guarantee the existence of extremal or quasi-solutions in the corresponding region bounded by upper and lower solutions of our problems. The case when a unique solution exists is also investigated. Some examples are given to illustrate...
-
Workshop on Algorithms And Models For The Web Graph
Conferences -
A Model of Thermal Energy Storage According to the Convention of Bond Graphs (BG) and State Equations (SE)
PublicationThe main advantage of the use of the Bond Graphs method and State Equations for modeling energy systems with a complex structure (marine power plants, hybrid vehicles, etc.) is the ability to model the system components of different physical nature using identical theoretical basis. The paper presents a method of modeling thermal energy storage, which is in line with basic BG theory. Critical comments have been put forward concerning...
-
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...
-
A city is not a tree: a multi-city study on street network and urban life
PublicationChristopher Alexander, a British-American scholar, differentiated an old (natural) city from a new (planned) one by structure. The former resembles a “semilattice”, or a complex system encompassing many interconnected sub-systems. The latter is shaped in a graph-theoretical “tree”, which lacks the structural complexity as its sub-systems are compartmentalized into a single hierarchy. This structural distinction explains why, or...
-
Anita Jaśkiewicz-Sojak dr inż. arch.
PeopleAnita Jaśkiewicz-Sojak (PhD Eng Arch) architect, architectural historian and conservator, assistant professor in the Department of History, Theory of Architecture and Monument Preservation, Faculty of Architecture, Gdańsk University of Technology. Education: graduate studies and doctoral studies in architecture and urban planning (Gdańsk University of Technology), graduate studies in history (University of Gdańsk) and post graduate...
-
COLREGS compliance in Evolutionary Sets of Cooperating Ship Trajectories
PublicationIn general, Evolutionary Sets of Cooperating Ship Trajectories combine some of the assumptions of game theory with evolutionary programming and aim to find optimal set of cooperating trajectoriesof all ships involved in an encounter situation. In a two-ship encounter situation the method enables the operator of an on-board collision-avoidance system to predict the most probable behaviour of atarget and to plan the own manoeuvres...
-
Kuram ve uygulamada egitim yönetimi Educational Management: Theory & Practice
Journals -
Enthymema-International Journal of Literary Criticism Literary Theory and Philosophy of Literature
Journals -
Opir Materialiv i Teoria Sporud-Strength of Materials and Theory of Structures
Journals -
Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice
Journals -
Kuram ve uygulamada eğitim yönetimi (Educational Management: Theory & Practice)
Journals -
Dynamic F-free Coloring of Graphs
PublicationA problem of graph F-free coloring consists in partitioning the vertex set of a graph such that none of the resulting sets induces a graph containing a fixed graph F as an induced subgraph. In this paper we consider dynamic F-free coloring in which, similarly as in online coloring, the graph to be colored is not known in advance; it is gradually revealed to the coloring algorithm that has to color each vertex upon request as well...
-
Optimal edge-coloring with edge rate constraints
PublicationWe consider the problem of covering the edges of a graph by a sequence of matchings subject to the constraint that each edge e appears in at least a given fraction r(e) of the matchings. Although it can be determined in polynomial time whether such a sequence of matchings exists or not [Grötschel et al., Combinatorica (1981), 169–197], we show that several questions about the length of the sequence are computationally intractable....
-
Maria Sołtysik prof. dr hab. inż. arch.
People -
On proper (1,2)‐dominating sets in graphs
PublicationIn 2008, Hedetniemi et al. introduced the concept of (1,)-domination and obtained some interesting results for (1,2) -domination. Obviously every (1,1) -dominating set of a graph (known as 2-dominating set) is (1,2) -dominating; to distinguish these concepts, we define a proper (1,2) -dominating set of a graph as follows: a subset is a proper (1,2) -dominating set of a graph if is (1,2) -dominating and it is not a (1,1) -dominating...
-
Szymon Kowalski mgr inż. arch.
PeopleResearch assistant in architectural studies of medieval and modern architecture in the Baltic Sea region. Scientifically, studies the possibilities of implementing virtual reality technology in the context of the conservation of architectural monuments and its impact on the theory of conservation, as well as the solutions for increasing the learning capabilities of architecture students.
-
On trees with double domination number equal to total domination number plus one
PublicationA total dominating set of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D. A vertex of a graph is said to dominate itself and all of its neighbors. A double dominating set of a graph G is a set D of vertices of G such that every vertex of G is dominated by at least two vertices of D. The total (double, respectively) domination number of a graph G is the minimum cardinality of a total (double,...
-
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees
PublicationAn edge coloring of a graph G is called interval edge coloring if for each v ∈ V(G) the set of colors on edges incident to v forms an interval of integers. A graph G is interval colorable if there is an interval coloring of G. For an interval colorable graph G, by the interval chromatic index of G, denoted by χ'_i(G), we mean the smallest number k such that G is interval colorable with k colors. A bipartite graph G is called (α,β)-biregular...
-
Rearrangeability in multicast Clos networks is NP-complete
PublicationPrzestrajalność w polach Closa z połączeniami jeden do jeden jest problemem wielomianowym. W pracy pokazano, że w polach z połączeniami jeden do wiele problem ten jest NP zupełny.Three-stage elos networks are commutation networks with circuit switching. So far, graph theory has been very useful tool for solving issues related to these networks with unicast connections. This is so because if elos network is represented as a bipartite...
-
Scheduling of unit-length jobs with cubic incompatibility graphs on three uniform machines
PublicationWe consider the problem of scheduling n identical jobs on 3 uniform machines with speeds s1, s2, and s3 to minimize the schedule length. We assume that jobs are subject to some kind of mutual exclusion constraints, modeled by a cubic incompatibility graph. We how that if the graph is 2-chromatic then the problem can be solved in O(n^2) time. If the graph is 3-chromatic, the problem becomes NP-hard even if s1>s2=s3.
-
Nonrelational Databases DE 2023_2024
e-Learning CoursesThis course discusses three types of non-relational databases (i.e., document, graph, and key-value). The course is aimed at students in the 5th semester of data engineering.
-
On Computational Aspects of Greedy Partitioning of Graphs
PublicationIn this paper we consider a problem of graph P-coloring consisting in partitioning the vertex set of a graph such that each of the resulting sets induces a graph in a given additive, hereditary class of graphs P. We focus on partitions generated by the greedy algorithm. In particular, we show that given a graph G and an integer k deciding if the greedy algorithm outputs a P-coloring with a least k colors is NP-complete for an infinite...
-
Equitable coloring of corona products of graphs
PublicationIn this paper we consider an equitable coloring of some corona products of graphs G and H in symbols, G o H). In particular, we show that deciding the colorability of G o H is NP-complete even if G is 4-regular and H is K_2. Next, we prove exact values or upper bounds on the equitable chromatic number of G o H, where G is an equitably 3- or 4-colorable graph and H is an r-partite graph, a path, a cycle or a complete graph.
-
Infinite chromatic games
PublicationIn the paper we introduce a new variant of the graph coloring game and a new graph parameter being the result of the new game. We study their properties and get some lower and upper bounds, exact values for complete multipartite graphs and optimal, often polynomial-time strategies for both players provided that the game is played on a graph with an odd number of vertices. At the end we show that both games, the new and the classic...
-
Studies in History and Theory of Architecture-Studii de Istoria si Teoria Arhitecturii
Journals -
On the Limiting Distribution of Lempel-Ziv’78 Redundancy for Memoryless Sources
PublicationWe study the Lempel-Ziv'78 algorithm and show that its (normalized) redundancy rate tends to a Gaussian distribution for memoryless sources. We accomplish it by extending findings from our 1995 paper, in particular, by presenting a new simplified proof of the central limit theorem (CLT) for the number of phrases in the LZ'78 algorithm. We first analyze the asymptotic behavior of the total path length in the associated digital search...
-
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...
-
Robert Hirsch dr hab. inż. arch.
People -
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS
Journals -
Brushing with additional cleaning restrictions
PublicationIn graph cleaning problems, brushes clean a graph by traversing it subject to certain rules. We consider the process where at each time step, a vertex that has at least as many brushes as incident, contaminated edges, sends brushes down these edges to clean them. Various problems arise, such as determining the minimum number of brushes (called the brush number) that are required to clean the entire graph. Here, we study a new variant...
-
Computational aspects of greedy partitioning of graphs
PublicationIn this paper we consider a variant of graph partitioning consisting in partitioning the vertex set of a graph into the minimum number of sets such that each of them induces a graph in hereditary class of graphs P (the problem is also known as P-coloring). We focus on the computational complexity of several problems related to greedy partitioning. In particular, we show that given a graph G and an integer k deciding if the greedy...
-
Non-relational Databases 2022/2023
e-Learning CoursesThis course discusses the three types of non-relational databases (i.e. document, graph, key-value). The course is aimed at students in the 7th semester of computer science.
-
Non-relational Databases 2023/2024
e-Learning CoursesThis course discusses the three types of non-relational databases (i.e. document, graph, key-value). The course is aimed at students in the 7th semester of computer science.
-
Rendezvous of Distance-Aware Mobile Agents in Unknown Graphs
PublicationWe study the problem of rendezvous of two mobile agents starting at distinct locations in an unknown graph. The agents have distinct labels and walk in synchronous steps. However the graph is unlabelled and the agents have no means of marking the nodes of the graph and cannot communicate with or see each other until they meet at a node. When the graph is very large we want the time to rendezvous to be independent of the graph size...
-
Edge and Pair Queries-Random Graphs and Complexity
PublicationWe investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters is NP-hard for bounded degree graphs.
-
Communication and Load Balancing Optimization for Finite Element Electromagnetic Simulations Using Multi-GPU Workstation
PublicationThis paper considers a method for accelerating finite-element simulations of electromagnetic problems on a workstation using graphics processing units (GPUs). The focus is on finite-element formulations using higher order elements and tetrahedral meshes that lead to sparse matrices too large to be dealt with on a typical workstation using direct methods. We discuss the problem of rapid matrix generation and assembly, as well as...
-
Piotr Bartłomiejczyk dr hab.
PeopleW roku 2014 zostałem zatrudniony w Katedrze Równań Różniczkowych i Zastosowań Matematyki na Wydziale Fizyki Technicznej i Matematyki Stosowanej Politechniki Gdańskiej. Zajmuję się badaniem niezmienników występujących w analizie nieliniowej. W roku 2000 uzyskałem stopień naukowy doktora w zakresie nauk matematycznych w Instytucie Matematycznym Polskiej Akademii Nauk w Warszawie. Uchwałą Rady Wydziału Matematyki, Fizyki i Informatyki...