Didn't find any results in this catalog!
But we have some results in other catalogs.displaying 1000 best results Help
Search results for: ALLIANCE PARTITIONING NUMBER
-
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...
-
On-Line Partitioning for On-Line Scheduling with Resource Conflicts
PublicationWithin this paper, we consider the problem of on-line partitioning the sequence of jobs which are competing for non-sharable resources. As a result of partitioning we get the subsets of jobs that form separate instances of the on-line scheduling problem. The objective is to generate a partition into the minimum number of instances such that the response time of any job in each instance is bounded by a given constant. Our research...
-
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...
-
The dynamic signature verification using population-based vertical partitioning
PublicationThe dynamic signature is an attribute used in behavioral biometrics for verifying the identity of an individual. This attribute, apart from the shape of the signature, also contains information about the dynamics of the signing process described by the signals which tend to change over time. It is possible to process those signals in order to obtain descriptors of the signature characteristic of an individual user. One of the methods...
-
Dynamic Signature Vertical Partitioning Using Selected Population-Based Algorithms
PublicationThe dynamic signature is a biometric attribute used for identity verification. It contains information on dynamics of the signing process. There are many approaches to the dynamic signature verification, including the one based on signature partitioning. Partitions are the regions created on the basis of signals describing the dynamics of the signature. They contain information on the shape of the signature characteristic of a...
-
Signature Partitioning Using Selected Population-Based Algorithms
PublicationDynamic signature is a biometric attribute which is commonly used for identity verification. Artificial intelligence methods, especially population-based algorithms (PBAs), can be very useful in the dynamic signature verification process. They are able to, among others, support selection of the most characteristic descriptors of the signature or perform signature partitioning. In this paper, we focus on creating the most characteristic...
-
Hybrid evolutionary partitioning algorithm for heat transfer enhancement in VLSI circuits
PublicationW niniejszym artykule przedstawiono metodę pozwalającą na polepszenie transferu ciepła z układu scalonego do otoczenia poprzez zwiększenie liczby połączeń zewnętrznych, co pozwoliło na polepszenie przewodności cieplnej układu scalonego. Dla osiągnięcia tego celu opracowano nowy, hybrydowy, ewolucyjny algorytm podziału (ang. Hybrid Evolutionary Partitioning Algorithm - HEPA). Obliczenia przeprowadzone dla wybranych przykładów testowych...
-
Life Science Alliance
Journals -
Isolation Number versus Domination Number of Trees
PublicationIf G=(VG,EG) is a graph of order n, we call S⊆VG an isolating set if the graph induced by VG−NG[S] contains no edges. The minimum cardinality of an isolating set of G is called the isolation number of G, and it is denoted by ι(G). It is known that ι(G)≤n3 and the bound is sharp. A subset S⊆VG is called dominating in G if NG[S]=VG. The minimum cardinality of a dominating set of G is the domination number, and it is denoted by γ(G)....
-
Strategic balance in graphs
PublicationFor a given graph G, a nonempty subset S contained in V ( G ) is an alliance iff for each vertex v ∈ S there are at least as many vertices from the closed neighbourhood of v in S as in V ( G ) − S. An alliance is global if it is also a dominating set of G. The alliance partition number of G was defined in Hedetniemi et al. (2004) to be the maximum number of sets in a partition of V ( G ) such that each set is an alliance. Similarly,...