Wyniki wyszukiwania dla: computational complexity
-
Synchronous black hole search in directed graphs
PublikacjaThe paper considers a team of robots which has to explore a graph G, where some nodes can be harmful. Robots are initially located at the so-called home base node. The dangerous nodes are the so-called black hole nodes, and once a robot enters in one of them, it is destroyed. The goal is to find a strategy in order to explore G in such a way that minimum number of robots is wasted. The exploration ends if there is at least one...
-
5G Millimeter Wave Network Optimization: Dual Connectivity and Power Allocation Strategy
PublikacjaThe fifth generation (5G) of mobile networks utilizing millimeter Wave (mmWave) bands can be considered the leading player in meeting the continuously increasing hunger of the end user demands in the near future. However, 5G networks are characterized by high power consumption, which poses a significant challenge to the efficient management of base stations (BSs) and user association. Implementing new power consumption and user...
-
Road Infrastructure Safety Management in Poland
PublikacjaThe objective of road safety infrastructure management is to ensure that when roads are planned, designed, built and used road risks can be identified, assessed and mitigated. Road transport safety is significantly less developed than that of rail, water and air transport. The average individual risk of being a fatality in relation to the distance covered is thirty times higher in road transport that in the other modes. This is...
-
State-of-the-art framework for high-speed camera and photogrammetric use in geometry evaluation of prestressed concrete failure process
PublikacjaPrestressed structures are a key to the realization of the boldest architectural ideas, regardless of shape complexity, great height and large span. A characteristic feature of the prestressed structure is the better use of concrete material properties by insertion of internal forces. The internal forces are opposed to external loads effects (forces and deformations of structure). Prestressed reinforced concrete beams are characterized...
-
Investigation of the thermal effects in water-lubricated journal bearings with axial grooves
PublikacjaWater-lubricated hydrodynamic journal bearings are frequently applied as stern tube bearings due to their advantages over other bearing types. They are environmentally friendly, can operate without sealings and in conditions of low friction losses. The most popular are bearings with open axial grooves, which require, for proper operation, forced axial flow of the lubricating water. Correctly designed and operated stern tube bearings...
-
A city is not a tree: a multi-city study on street network and urban life
PublikacjaChristopher 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...
-
Weighted 2-sections and hypergraph reconstruction
PublikacjaIn the paper we introduce the notion of weighted 2-sections of hypergraphs with integer weights and study the following hypergraph reconstruction problems: (1) Given a weighted graph , is there a hypergraph H such that is its weighted 2-section? (2) Given a weighted 2-section , find a hypergraph H such that is its weighted 2-section. We show that (1) is NP-hard even if G is a complete graph or integer weights w does not exceed...
-
Paired domination subdivision and multisubdivision numbers of graphs
PublikacjaThe paired domination subdivision number sdpr(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 paired domination number of G. We prove that the decision problem of the paired domination subdivision number is NP-complete even for bipartite graphs. For this reason we define the paired domination muttisubdivision number of a nonempty graph...
-
Polynomial Algorithm for Minimal (1,2)-Dominating Set in Networks
PublikacjaDominating 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...
-
Domination subdivision and domination multisubdivision numbers of graphs
PublikacjaThe 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...
-
On the hardness of computing span of subcubic graphs
PublikacjaIn the paper we study the problem of finding ξ-colorings with minimal span, i.e. the difference between the largest and the smallest color used.
-
On Computational Aspects of Greedy Partitioning of Graphs
PublikacjaIn 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...
-
Collaborative Delivery by Energy-Sharing Low-Power Mobile Robots
PublikacjaWe study two variants of delivery problems for mobile robots sharing energy. Each mobile robot can store at any given moment at most two units of energy, and whenever two robots are at the same location, they can transfer energy between each other, respecting the maximum capacity. The robots operate in a simple graph and initially each robot has two units of energy. A single edge traversal by an robot reduces its energy by one...
-
Quantum-classical calculations of the nanomechanical properties of metals
PublikacjaTradycyjnie symulacje komputerowe układów w skali atomowej prowadzone są przy użyciu klasycznej metody dynamiki molekularnej (MD) bądź kwantowych metod ab initio. Główną wadą ujęcia klasycznego jest jego empiryczna natura, a co za tym idzie - niewielka przenośność, jego prostota natomiast pozwala na przeprowadzanie symulacji układów zawierających miliony atomów. W wyniku zastosowania metod kwantowych otrzymuje się bardziej wiarygodne...
-
The Role of Daylight in Forming the Traditional Space: Classification of Traditional Iranian Daylighting Elements
PublikacjaDaylight character in a space can be defined as the manner in which daylight permeates and is dispersed in that space. The architectural elements related to daylighting under investigation in this study were rooted in Iranian-Isfahani heritage, considered traditional Iranian architecture (from the 16th to early 20th century). The establishment of a classification system for daylighting systems holds significant utility. This...