A5071787064- Optimization and Search Problems
- Complexity and Algorithms in Graphs
- Distributed systems and fault tolerance
- Advanced Graph Theory Research
- Opportunistic and Delay-Tolerant Networks
- Game Theory and Applications
- Artificial Intelligence in Games
- Complex Network Analysis Techniques
- Data Management and Algorithms
- Distributed Control Multi-Agent Systems
- Distributed and Parallel Computing Systems
- Cryptography and Data Security
- Peer-to-Peer Network Technologies
- Scheduling and Optimization Algorithms
- Computational Geometry and Mesh Generation
- Scheduling and Timetabling Solutions
- Topological and Geometric Data Analysis
- Advanced Optical Network Technologies
- Software-Defined Networks and 5G
- Mobile Crowdsensing and Crowdsourcing
- Smart Parking Systems Research
- Mobile Ad Hoc Networks
- Advanced Wireless Network Optimization
- Cloud Computing and Resource Management
- Network Traffic and Congestion Control
University of Gdańsk
2006-2021
Gdańsk University of Technology
2004-2019
Abstract Distributed greedy coloring is an interesting and intuitive variation of the standard problem. Given order among colors, a said to be if there does not exist vertex for which its associated color can replaced by lower position in fixed without violating property that neighboring vertices must receive different colors. We consider problems Greedy Coloring Largest First (a variant with strengthened constraints) Linial model distributed computation, providing upper bounds comparison (Δ...
We present a new distributed algorithm for coloring the vertices of graph. A practical simulation shows that this performs much better then naive algorithm.
Utilization of alternate communication paths is a common technique to provide protection transmission against failures network nodes/links. However, noticeable delay encountered when calculating the relevant sets disjoint using available algorithms (e.g., Bhandari's approach). This, in turn, may have serious impact on ability serve dynamic demands (i.e., characterized by relatively short duration time). To solution this problem, article we introduce an approach pre-compute advance be able...
In this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function $${\omega }$$ provides each vertex $$v$$ minimum number of searchers required to guard , i.e., fugitive may not pass through without being detected only if at least }(v)$$ are present . This is a generalization classical problem, in which one has }\equiv 1$$ We assume that graph $$G$$ be searched, there associated partition $$(V_1,\ldots ,V_t)$$ its...
When performing an algorithm in the self-stabilizing model, a distributed system must achieve desirable global state regardless of initial state, whereas each node has only local information about system. Depending on adopted assumptions concerning model simultaneous execution and scheduler fairness, some algorithms may differ stabilization time or possibly not stabilize at all. Surprisingly, we show that class polynomially-solvable problems is invariant with respect to assumption weak...
A lot of research has been done in the field graph coloring, yet there are no publicly released libraries available. This paper introduces such a library. library is designed to meet several important criteria for industrial applications. Most importantly, it with performance mind. Several heuristic algorithms implemented deal NP-completeness. Further optimizations at code level. The written C++ components that can be used independently. Upon completion, Koala will as open source, and free...
In the distributed localization problem (DLP), n anonymous robots (agents) A0, A1, ..., A(n-1) begin at arbitrary positions p0, p(n-1) in S, where S is a Euclidean space. The primary goal DLP for agents to reach consensus on unified coordinate system that accurately reflects relative of all points, ... , p(n-1), S. Extensive research has primarily focused feasibility and complexity achieving when have limited access inter-agent distances, often due missing or imprecise data. this paper,...
Protection of transmission against failures can be appropriately dealt with by alternative paths. However, common schemes (e.g., Bhandari's scheme) are characterized a remarkable delay while determining the This in turn may have serious impact on serving dynamic demands (characterized relatively short duration time). As remedy to this problem, we introduce an approach pre-compute sets disjoint paths advance able start once they arrived. In particular, since issue establishing set...