Search
Filters
total: 42
filtered: 25
-
Catalog
Chosen catalog filters
Search results for: co-np-completeness
-
NP-completeness of convex and weakly convex domiating set decision problems.
PublicationLiczby dominowania wypukłego i słabo wypukłego są nowymi rodzajami liczb dominowania. W tym artykule pokazujemy, że problemy decyzyjne dominowania wypukłegi i słabo wypukłego są NP-zupełne w przypadku grafów dwudzielnych oraz split grafów. Posługując się zmodyfikowanym algorytmem Washalla możemy w czasie wielomianowym określić, czy dany podzbiór wierzchołków grafu jest spójny bądź słabo spójny.
-
Tight bounds on global edge and complete alliances in trees
PublicationIn the talk the authors present some tight upper bounds on global edge alliance number and global complete alliance number of trees. Moreover, we present our NP-completeness results from [8] for global edge alliances and global complete alliances on subcubic bipartite graphs without pendant vertices. We discuss also polynomial time exact algorithms for finding the minimum global edge alliance on trees [7] and complete alliance...
-
Searching by heterogeneous agents
PublicationIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs: once a search strategy initially assigns labels to the searchers, each searcher can be only present on an edge of its own label. We prove that this problem is not monotone even for trees and we give instances...
-
Global edge alliances in graphs
PublicationIn the paper we introduce and study a new problem of finding a minimum global edge alliance in a graph which is related to the global defensive alliance (Haynes et al., 2013; Hedetniemi, 2004) and the global defensive set (Lewoń et al., 2016). We proved the NP-completeness of the global edge alliance problem for subcubic graphs and we constructed polynomial time algorithms for trees. We found the exact values of the size of the...
-
Searching by Heterogeneous Agents
PublicationIn this work we introduce and study a pursuit-evasion game in which the search is performed by heterogeneous entities. We incorporate heterogeneity into the classical edge search problem by considering edge-labeled graphs. In such setting a searcher, once a search strategy initially decides on the label of the searcher, can be present on an edge only if the label of the searcher and the label of the edge are the same. We prove...
-
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...
-
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...
-
Optimization issues in distributed computing systems design
PublicationIn recent years, we observe a growing interest focused on distributed computing systems. Both industry and academia require increasing computational power to process and analyze large amount of data, including significant areas like analysis of medical data, earthquake, or weather forecast. Since distributed computing systems – similar to computer networks – are vulnerable to failures, survivability mechanisms are indispensable...
-
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...
-
Modele i algorytmy dla grafowych struktur defensywnych
PublicationW niniejszej pracy przeprowadzono analizę złożoności istnienia struktur defensywnych oraz równowag strategicznych w grafach. W przypadku struktur defensywnych badano modele koalicji defensywnych, zbiorów defensywnych i koalicji krawędziowych – każdy z nich w wersji globalnej, tj. z wymogiem dominacji całego grafu. W przypadku modeli równowagi strategicznej badano równowagę strategiczną koalicji defensywnych, równowagę strategiczną...
-
Completeness and Consistency of the System Requirement Specification
PublicationAlthough the System Requirement Specification, as a first formal and detailed document, is the base for the software project in classic software methodologies, there is a noticeable problem of assuring the completeness of this document. The lack of its completeness causes uncertainty of the project foundations. This was one of motivations for agile methodologies – if the SRS cannot be easily validated, if it can change in late project...
-
Passing from requirements specification to class model using application domain ontology
PublicationThe quality of a classic software engineering process depends on the completeness of project documents and on the inter-phase consistency. In this paper, a method for passing from the requirement specification to the class model is proposed. First, a developer browses the text of the requirements, extracts the word sequences, and places them as terms into the glossary. Next, the internal ontology logic for the glossary needs to...
-
Sources of Market Information, Its Quality and New Product Financial Performance
PublicationWhile we observe a growing interest in the role of market information in new product development (NPD), existing research has still largely ignored the quality of market information that is a crucial issue in the era of the information society. What does affect the quality of market information in new product development projects, and how does this quality influence the financial performance of new products? In this paper, we address...
-
Reliability of Pulse Measurements in Videoplethysmography
PublicationReliable, remote pulse rate measurement is potentially very important for medical diagnostics and screening. In this paper the Videoplethysmography was analyzed especially to verify the possible use of signals obtained for the YUV color model in order to estimate the pulse rate, to examine what is the best pulse estimation method for short video sequences and finally, to analyze how potential PPG-signals can be distinguished from...
-
Distance learning trends: introducing new solutions to data analysis courses
PublicationNowadays data analysis of any kind becomes a piece of art. The same happens with the teaching processes of statistics, econometrics and other related courses. This is not only because we are facing (and are forced to) teach online or in a hybrid mode. Students expect to see not only the theoretical part of the study and solve some practical examples together with the instructor. They are waiting to see a variety of tools, tutorials,...
-
Fake News: Possibility of Identification in Post-Truth Media Ecology System
PublicationInformation comes as basic good which affects social well-being. A modern society and a modern state – its administration, education, culture, national economy and armed forces – cannot function efficiently without a rationally developed field of information. The quality of the functioning of that system depends on a specific feature of information, that is namely: its reliability which makes it possible for us to evaluate accuracy,...
-
Unveiling the Pool of Metallophores in Native Environments and Correlation with Their Potential Producers
PublicationFor many organisms, metallophores are essential biogenic ligands that ensure metal scavenging and acquisition from their environment. Their identification is challenging in highly organic matter rich environments like peatlands due to low solubilization and metal scarcity and high matrix complexity. In contrast to common approaches based on sample modification by spiking of metal isotope tags, we have developed a two-dimensional...
-
Information retrieval with semantic memory model
PublicationPsycholinguistic theories of semantic memory form the basis of understanding of natural language concepts. These theories are used here as an inspiration for implementing a computational model of semantic memory in the form of semantic network. Combining this network with a vector-based object-relation-feature value representation of concepts that includes also weights for confidence and support, allows for recognition of concepts...
-
THE 3D MODEL OF WATER SUPPLY NETWORK WITH APPLICATION OF THE ELEVATION DATA
Publication3D visualization is a key element of research and analysis and as the source used by experts in various fields e.g.: experts from water and sewage systems. The aim of this study was to visualize in three-dimensional space model of water supply network with relief. The path of technological development of GESUT data (Geodezyjna Ewidencja Sieci Uzbrojenia Terenu – geodetic records of public utilities) for water supply and measurement...
-
NEW PRODUCT DEVELOPMENT FROM THE PERSPECTIVE OF CREATING A COMPETITIVE ADVANTAGE
PublicationIt is acknowledged that achieving product-based competitive advantage is a key task for a company. However, there is still a research gap in determining those specific actions in the process of developing new products that arise from companies' efforts to achieve product-based competitive advantage. Therefore, the aim of this study is to determine the specific actions in the new product development (NPD) process that result from...
-
Ranking of Generation Source Locations by a Hybrid Multi-Criteria Method
PublicationThe paper presents a ranking of the locations of eight renewable energy sources (RES) made using a hybrid multi-criteria analysis method. The method is a combination of the analytical hierarchical process (AHP) method and numerical taxonomy. The considered generating sources, i.e. solar plants, biogas plants, and wind farms are sources that will significantly contribute to implementing the provisions of the energy and climate package...
-
Ecology In Tribology: Selected Problems of Eliminating Natural Oil-Based Lubricants from Machine Friction Couples
PublicationThe elimination of mineral oil-based lubricants from machines has multiple beneficial effects on the natural environment. Firstly – these lubricants are a direct threat to the environment in the event of leaks; secondly – their elimination reduces the demand for crude oil from which they are obtained. In addition, in many cases, e.g. when replacing traditional lubricants with water, friction losses in the bearings can also be reduced...
-
Assessing Tram Infrastructure Safety Using the Example of the City of Gdańsk
PublicationAnalysis of Gdańsk’s tram network statistics shows that incidents are quite frequent (about 650 within 5 years) and mostly involve collisions and crashes. As well as reducing the tram systems’ efficiency and reliability, incidents have a nega-tive effect on road safety. As Polish cities extend their tram networks, they must also ensure that their existing networks are safe. This is to be achieved by conducting safety assessments....
-
Global defensive sets in graphs
PublicationIn the paper we study a new problem of finding a minimum global defensive set in a graph which is a generalization of the global alliance problem. For a given graph G and a subset S of a vertex set of G, we define for every subset X of S the predicate SEC ( X ) = true if and only if | N [ X ] ∩ S | ≥ | N [ X ] \ S | holds, where N [ X ] is a closed neighbourhood of X in graph G. A set S is a defensive alliance if and only if for...
-
Graph security testing
PublicationSet S ⊂ V is called secure set iff ∀ X ⊂ S | N [ X ] ∩ S | ≥ | N ( X ) \ S | [3]. That means that every subset of a secure set has at least as many friends (neighbour vertices in S) as enemies (neighbour vertices outside S) and will be defended in case of attack. Problem of determining if given set is secure is co −NP -complete, there is no efficient algorithm solving it [3]. Property testers are algorithms that distinguish inputs...