All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 46 Next

Displaying 901 – 920 of 8522

Showing per page

Algorithm for the complement of orthogonal operations

Iryna V. Fryz (2018)

Commentationes Mathematicae Universitatis Carolinae

G. B. Belyavskaya and G. L. Mullen showed the existence of a complement for a k -tuple of orthogonal n -ary operations, where k < n , to an n -tuple of orthogonal n -ary operations. But they proposed no method for complementing. In this article, we give an algorithm for complementing a k -tuple of orthogonal n -ary operations to an n -tuple of orthogonal n -ary operations and an algorithm for complementing a k -tuple of orthogonal k -ary operations to an n -tuple of orthogonal n -ary operations. Also we find some...

Algorithmic aspects of total-subdomination in graphs

Laura M. Harris, Johannes H. Hattingh, Michael A. Henning (2006)

Discussiones Mathematicae Graph Theory

Let G = (V,E) be a graph and let k ∈ Z⁺. A total k-subdominating function is a function f: V → {-1,1} such that for at least k vertices v of G, the sum of the function values of f in the open neighborhood of v is positive. The total k-subdomination number of G is the minimum value of f(V) over all total k-subdominating functions f of G where f(V) denotes the sum of the function values assigned to the vertices under f. In this paper, we present a cubic time algorithm to compute the total k-subdomination...

Algorithms for Finding Unitals and Maximal Arcs in Projective Planes of Order 16

Stoichev, Stoicho (2007)

Serdica Journal of Computing

The paper has been presented at the International Conference Pioneers of Bulgarian Mathematics, Dedicated to Nikola Obreshkoff and Lubomir Tschakalo ff , Sofia, July, 2006.Two heuristic algorithms (M65 and M52) for finding respectively unitals and maximal arcs in projective planes of order 16 are described. The exact algorithms based on exhaustive search are impractical because of the combinatorial explosion (huge number of combinations to be checked). Algorithms M65 and M52 use unions of orbits...

Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs*, **

Marina Groshaus, Jayme Luis Szwarcfiter (2011)

RAIRO - Operations Research

A hypergraph is Helly if every family of hyperedges of it, formed by pairwise intersecting hyperedges, has a common vertex. We consider the concepts of bipartite-conformal and (colored) bipartite-Helly hypergraphs. In the same way as conformal hypergraphs and Helly hypergraphs are dual concepts, bipartite-conformal and bipartite-Helly hypergraphs are also dual. They are useful for characterizing biclique matrices and biclique graphs, that is, the...

Algorithms for recognizing bipartite-Helly and bipartite-conformal hypergraphs*, **

Marina Groshaus, Jayme Luis Szwarcfiter (2011)

RAIRO - Operations Research

A hypergraph is Helly if every family of hyperedges of it, formed by pairwise intersecting hyperedges, has a common vertex. We consider the concepts of bipartite-conformal and (colored) bipartite-Helly hypergraphs. In the same way as conformal hypergraphs and Helly hypergraphs are dual concepts, bipartite-conformal and bipartite-Helly hypergraphs are also dual. They are useful for characterizing biclique matrices and biclique graphs, that is, the...

Algorithms for the two dimensional bin packing problem with partial conflicts

Khaoula Hamdi-Dhaoui, Nacima Labadie, Alice Yalaoui (2012)

RAIRO - Operations Research

The two-dimensional bin packing problem is a well-known problem for which several exact and approximation methods were proposed. In real life applications, such as in Hazardous Material transportation, transported items may be partially incompatible, and have to be separated by a safety distance. This complication has not yet been considered in the literature. This paper introduces this extension called the two-dimensional bin packing problem with partial conflicts (2BPPC) which is a 2BP with distance...

Algorithms for the two dimensional bin packing problem with partial conflicts

Khaoula Hamdi-Dhaoui, Nacima Labadie, Alice Yalaoui (2012)

RAIRO - Operations Research

The two-dimensional bin packing problem is a well-known problem for which several exact and approximation methods were proposed. In real life applications, such as in Hazardous Material transportation, transported items may be partially incompatible, and have to be separated by a safety distance. This complication has not yet been considered in the literature. This paper introduces this extension called the two-dimensional bin packing problem with partial conflicts (2BPPC) which is a 2BP with distance...

Algunos grafos compuestos.

Miguel Angel Fiol Mora, Josep Fàbrega Canudas (1983)

Stochastica

From two graphs G1 and G2 on N1 and N2 vertices respectively, the compound graph G1[G2] on N1N2 vertices is obtained by connecting in some way N2 copies of G1.We present in this paper methods of compounding that result in families of graphs with large number of vertices for given values of the maximum degree ∆ and diameter D.

Currently displaying 901 – 920 of 8522