Search
displaying 1000 best results Help
Search results for: bounded-degree graphs
-
Ireneusz Czarnowski Prof.
PeopleIRENEUSZ CZARNOWSKI is a graduate of the Faculty of Electrical Engineering at Gdynia Maritime University. He gained a doctoral degree in the field of computer science at Poznan University of Technology and a postdoctoral degree in the field of computer science at Wroclaw University of Science and Technology. Since 1998 is associated with Gdynia Maritime University, currently is a professor of computer science in the Department...
-
The International Workshop on Algorithms and Graphs
Conferences -
Vipin Kumar Oad mgr. inż.
PeopleVipin Kumar Oad has a Master of Science Degree in Integrated Water Resources Management (IWRM) and a Bachelor of Engineering Degree in Agriculture. During his MS studies, he achieved an opportunity to visit the United States of America and study one semester at The University of Utah, USA. Currently, he's pursuing his Ph.D. in Civil Engineering and Transport at the Gdansk University of Technology, Gdansk, Poland. His research interests...
-
Maciej Łojkowski
People -
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...
-
Krzysztof Armiński dr inż.
PeopleKrzysztof Armiński received his PhD in Control System Enginiering from the Gdańsk University of Technology in 2014 Currently he is a assistant professor of Control Enginiering at the Gdańsk University of Technology. His research interests are in the field of set bounded state estimation and modeling for control purpose.
-
Occupational Health and Safety Ergonomics - L-15/Ć-0/L-0/P-0, FMEST, ENERGY TECHNOLOGIES, I degree, se 01, stationary, (PG_00041987), winter semester 2022/2023
e-Learning CoursesDefinitions of ergonomics, its subject, purpose and application. Description of the human-machine system environment. The concept of sustainable development. Environmental management systems. Human model and its characteristics. Human possibilities and industrial processes. Human work environment - material conditions. Principles of human work environment design. Safety and reliability of the human - machine - environment system....
-
Arsalan Muhammad Soomar Doctoral Student
PeopleHi, I'm Arsalan Muhammad Soomar, an Electrical Engineer. I received my Master's and Bachelor's Degree in the field of Electrical Engineering from Mehran University of Engineering and Technology, Jamshoro, Sindh, Pakistan. Currently enrolled as a Doctoral student at the Gdansk University of Technology, Gdansk, Poland. Also worked in Yellowlite. INC, Ohio as a Solar Design Engineer. HEADLINE Currently Enrolled as a Doctoral...
-
Kacper Wereszko mgr inż.
PeopleKacper Wereszko received the M.Sc. in 2016 (field of study: computer science, specialization: Internet technologies and algorithms). Since 2017 he is a Ph.D. student in the field of computer science. He works as assistant in Department of Algorithms and System Modelling. His research interests focus on security properties of graphs, domination problems in graphs and their practical applications.
-
Latin-American Algorithms, Graphs and Optimization Symposium
Conferences -
Cologne-Twente Workshop on Graphs and Combinatorial Optimization
Conferences -
Adolfo Poma
PeopleI am the group leader of the computational modelling of biomolecules divison at the institute of Fundamental Technological Research Polish Academy of Sciences in Poland. My group was hosted between 2021-2022 by International Centre for Research on Innovative Bio-based Materials (ICRI-BioM). In 2008, I got a Master degree in computational physics from the State University of Campinas, Brazil. Then I moved to Germany and under the...
-
Michał Grochowski dr hab. inż.
PeopleProfessor and a Head of the Department of Intelligent Control and Decision Support Systems at Gdansk University of Technology (GUT). He is also a Member of the Board of the Digital Technologies Center of GUT. He received his M.Sc. degree in Control Engineering in 2000 from the Electrical and Control Engineering Faculty at the GUT. In 2004 he received a Ph.D. degree in Automatic Control and Robotics from this...
-
Zero-visibility cops and robber and the pathwidth of a graph
PublicationWe 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...
-
Harmonic Analysis
Open Research DataWe construct a decomposition of the identity operator on a Riemannian manifold M as a sum of smooth orthogonal projections subordinate to an open cover of M. This extends a decomposition on the real line by smooth orthogonal projection due to Coifman and Meyer (C. R. Acad. Sci. Paris, Sér. I Math., 312(3), 259–261 1991) and Auscher, Weiss, Wickerhauser...
-
Equivalence of equicontinuity concepts for Markov operators derived from a Schur-like property for spaces of measures
PublicationVarious equicontinuity properties for families of Markov operators have been – and still are – used in the study of existence and uniqueness of invariant probability for these operators, and of asymptotic stability. We prove a general result on equivalence of equicontinuity concepts. It allows comparing results in the literature and switching from one view on equicontinuity to another, which is technically convenient in proofs....
-
A note on an approximative scheme of finding almost homoclinic solutions for Newtonian systems
PublicationIn this work we will be concerned with the existence of an almost homoclinic solution for a perturbed Newtonian system in a finite dimensional space. It is assumed that a potential is C^1 smooth and its gradient is bounded with respect to a time variable. Moreover, a forcing term is continuous, bounded and squere integrable. We will show that the appproximative scheme due to J. Janczewska for a time periodic potential extends to...
-
Tomasz Zubowicz dr inż.
PeopleTomasz Zubowicz has received his M.Sc. Eng. degree in Control Engineering from the Faculty of Electrical and Control Engineering at the Gda{\'n}sk University of Technology (GUT) in $2008$. He received his Ph.D. Eng. (Hons.) in the field of Control Engineering from the same faculty in $2019$. In $2012$ he became a permanent staff member at the Department of Intelligent Control and Decision Support Systems at GUT and a member of...
-
A survey on known values and bounds on the Shannon capacity
PublicationIn this survey we present exact values and bounds on the Shannon capacity for different classes of graphs, for example for regular graphs and Kneser graphs. Additionally, we show a relation between Ramsey numbers and Shannon capacity.
-
Michał Lech dr inż.
PeopleMichał Lech was born in Gdynia in 1983. In 2007 he graduated from the faculty of Electronics, Telecommunications and Informatics of Gdansk University of Technology. In June 2013, he received his Ph.D. degree. The subject of the dissertation was: “A Method and Algorithms for Controlling the Sound Mixing Processes by Hand Gestures Recognized Using Computer Vision”. The main focus of the thesis was the bias of audio perception caused...
-
FTIR in situ - ethylene decomposition on TiO2
Open Research DataThese data contain FTIR spectra recorded in FTIR spectrometer Nicolet iS50 coupled with High Temperature Chamber "The Praying Mantis". These spectra were measured for TiO2 irradiated by UV and under flowing of ethylene gas diluted in air. FTIR spectra were measured in situ during the photocatalytic process of ethylene decomposition. In order to identify...
-
Artur Gańcza dr inż.
PeopleI received the M.Sc. degree from the Gdańsk University of Technology (GUT), Gdańsk, Poland, in 2019. I am currently a Ph.D. student at GUT, with the Department of Automatic Control, Faculty of Electronics, Telecommunications and Informatics. My professional interests include speech recognition, system identification, adaptive signal processing and linear algebra.
-
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....
-
Product Graph Invariants with Applications in the Theory of Information
PublicationThere 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...
-
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...
-
International Conference on Relations, Orders and Graphs: Interaction with Computer Science
Conferences -
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...
-
Krzysztof Kutt dr inż.
PeopleComputer scientist and psychologist trying to combine expertise from both disciplines into something cool. My research activity focuses on the development of affective HCI/BCI interfaces (based on multimodal fusion of signals and contextual data), methods for processing sensory data (including semantization of such data) and the development of knowledge-based systems (in particular knowledge graphs and semantic web systems).
-
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.
-
Counting Lattice Paths With Four Types of Steps
Publication -
Roland Ryndzionek dr inż.
PeopleI received the M.Sc. degree in Electrical Engineering from Gdańsk University of Technology (Gdańsk Tech), Gdańsk, Poland, in 2010, the M.Sc. degree in Electrical Engineering from INP ENSEEIHT, Toulouse, France, in 2012, and the Ph.D. degree in Electrical Engineering from Gdańsk Tech and INP, in 2015. From 2015 to 2017. I was a postdoctoral research engineer at the SuperGrid Institute Lyon, France. Since 2017, I have been working...
-
Bounds on isolated scattering number
PublicationThe isolated scattering number is a parameter that measures the vulnerability of networks. This measure is bounded by formulas de- pending on the independence number. We present new bounds on the isolated scattering number that can be calculated in polynomial time.
-
Bounds on isolated scattering number
PublicationThe isolated scattering number is a parameter that measures the vulnerability of networks. This measure is bounded by formulas de- pending on the independence number. We present new bounds on the isolated scattering number that can be calculated in polynomial time.
-
A construction for the hat problem on a directed graph
PublicationA team of n players plays the following game. After a strategy session, each player is randomly fitted with a blue or red hat. Then, without further communication, everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. Visibility is defined by a directed graph; that is, vertices correspond to players, and a player can see each player to whom he is connected by an arc. The...
-
Rothe’s method for physiologically structured models with diffusion
PublicationWe consider structured population models with diffusion and dynamic boundary conditions. The respective approximation, called Rothe’s method, produces positive and exponentially bounded solutions. Its solutions converge to the exact solution of the original PDE.
-
Restricted open shop scheduling
PublicationIn the real applications the open shop scheduling models often require some additional constraints and adequate models. We concern the restrictions in the open shop scheduling related to an instance of the problem and to a feasible solution. Precisely, we require that each jobs consists of the bounded number of operations and each machine has a bounded load (i.e., the total number of operations executed on this machine in a schedule)....
-
Parseval Wavelet Frames on Riemannian Manifold
PublicationWe construct Parseval wavelet frames in L 2 (M) for a general Riemannian manifold M and we show the existence of wavelet unconditional frames in L p (M) for 1 < p < ∞. This is made possible thanks to smooth orthogonal projection decomposition of the identity operator on L 2 (M), which was recently proven by Bownik et al. (Potential Anal 54:41–94, 2021). We also show a characterization of Triebel–Lizorkin F sp,q (M) and Besov B...
-
Michał Tomasz Kucewicz dr
PeopleMichal Kucewicz was born in 1986 in Gdansk. In 2005 he completed International Baccalaureate programme in Topolowka (III High School in Gdańsk). Thanks to the G. D. Fahrenheit scholarship, he moved to the United Kingdom to study neuroscience. He received his Bachelor’s and Master’s degree from the Cambridge University, and his doctoral degree from the University of Bristol specializing in electrophysiology of memory and cognitive...
-
Dedicated scheduling of tasks to minimize mean flow time
PublicationThis paper investigates the complexity of scheduling biprocessor tasks on dedicated processors to minimize mean flow time. Since the general problem is strongly NP-hard, we assume some restrictions on task lengths and the structure of associated scheduling graphs. Of particular interest are acyclic graphs. In this way we identify a borderline between NP-hard and polynomially solvable special cases.
-
Influence of edge subdivision on the convex domination number
PublicationWe study the influence of edge subdivision on the convex domination number. We show that in general an edge subdivision can arbitrarily increase and arbitrarily decrease the convex domination number. We also find some bounds for unicyclic graphs and we investigate graphs G for which the convex domination number changes after subdivision of any edge in G.
-
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...
-
Generalized Dobrushin Coefficients on Banach Spaces
PublicationThe asymptotic behavior of iterates of bounded linear operators (not necessarily positive), acting on Banach spaces, is studied. Through the Dobrushin ergodicity coefficient, we generalize some ergodic theorems obtained earlier for classical Markov semigroups acting on L1 (or positive operators on abstract state spaces).
-
Adam Dąbrowski dr inż.
PeopleAdam Dabrowski has obtained a PhD in mechanical engineering from Gdańsk University of Technology and MSc. degree in mechatronics from Technische Universität Hamburg. He has an industry experience in Institute of Aviation Engineering Design Center (Warsaw, Poland) and SICK AG (Hamburg, Germany). Additionally, as an assistant at Gdansk University of Technology he teaught courses on mechanics, space mechanisms and dynamics of space...
-
Wykorzystanie tomografii komputerowej przy analizie jakości zacementowania - migracja gazu
PublicationArtykuł przedstawia opis zjawiska znanego w wiertnictwie otworowym jako migracja gazu. Opisano główne przyczyny powstawania tego negatywnego zjawiska polegającego na przepływie gazów a także płynów w zaczynie cementacyjnym lub kamieniu cementowym. Przygotowano próbki imitujące zacementowany odcinek rur okładzinowych. Skupiono się na wykorzystaniu tomografii komputerowej, oraz analizie zrekonstruowanego trójwymiarowego obrazu, w...
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublicationDominating sets find application in a variety of networks. A subset of nodes D is a (1,2)-dominating set in a graph G=(V,E) if every node not in D is adjacent to a node in D and is also at most a distance of 2 to another node from D. In networks, (1,2)-dominating sets have a higher fault tolerance and provide a higher reliability of services in case of failure. However, finding such the smallest set is NP-hard. In this paper, we...
-
Sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych
PublicationW pracy rozpatrywane są sprawiedliwe i półsprawiedliwe pokolorowania grafów kubicznych. Pokazano, że w odróżnieniu od tego pierwszego, który jest łatwy, problem istnienia pokolorowań półsprawiedliwych jest NP-zupełny w szerokim zakresie parametrów grafów.
-
Michał Sobaszek dr inż.
PeopleMichał Sobaszek was born in Gdansk in 1984. In the summer of 2009, he received a Master degree in Materials Engineering at Gdansk University of Technology. Currently, he is an Assistant Professor at the Faculty of Electronics at the Gdańsk University of Technology. In 2018 he was honoured with the scholarship for the outstanding young researches by the Minister of Science and Higher Education of Poland. For more than 7 years, he...
-
Kamila Kokot-Kanikuła mgr
PeopleKamila Kokot-Kanikuła is a digital media senior librarian at Gdańsk University of Technology (GUT) Library. She works in Digital Archive and Multimedia Creation Department and her main areas of interests include early printed books, digital libraries, Open Access and Open Science. In the Pomeranian Digital Library (PDL) Project she is responsible for creating annual digital plans, transferring files on digital platform, and promoting...
-
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...
-
Recurrence times in the Morse sets for a two-dimensional discrete neuron model (low resolution)
Open Research DataThis dataset contains selected results of rigorous numerical computations conducted in the framework of the research described in the paper “Topological-numerical analysis of a two-dimensional discrete neuron model” by Paweł Pilarczyk, Justyna Signerska-Rynkowska and Grzegorz Graff. A preprint of this paper is available at https://doi.org/10.48550/arXiv.2209.03443.