Search results for " graph"
showing 10 items of 1277 documents
Optical Routing of Uniform Instances in Cayley Graphs
2001
Abstract Abstract We consider the problem of routing uniform communication instances in Cayley graphs. Such instances consist of all pairs of nodes whose distance is included in a specified set U. We give bounds on the load induced by these instances on the links and for the wavelength assignment problem as well. For some classes of Cayley graphs that have special symmetry property (rotational graphs), we are able to construct routings for uniform instances such that the load is the same for each link of the graph.
On the Low-Dimensional Steiner Minimum Tree Problem in Hamming Metric
2011
It is known that the d-dimensional Steiner Minimum Tree Problem in Hamming metric is NP-complete if d is considered to be a part of the input. On the other hand, it was an open question whether the problem is also NP-complete in fixed dimensions. In this paper we answer this question by showing that the problem is NP-complete for any dimension strictly greater than 2. We also show that the Steiner ratio is 2 - 2/d for d ≥ 2. Using this result, we tailor the analysis of the so-called k-LCA approximation algorithm and show improved approximation guarantees for the special cases d = 3 and d = 4.
An optimal method for the mixed postman problem
2005
k-Weakly almost convex groups and ? 1 ? $$\tilde M^3 $$
1993
We extend Cannon's notion ofk-almost convex groups which requires that for two pointsx, y on then-sphere in the Cayley graph which can be joined by a pathl1 of length ≤k, there is a second pathl2 in then-ball, joiningx andy, of bounded length ≤N(k). Ourk-weakly almost convexity relaxes this condition by requiring only thatl1 ∝l2 bounds a disk of area ≤C1(k)n1 - e(k) +C2(k). IfM3 is a closed 3-manifold with 3-weakly almost convex fundamental group, then π1∞\(\tilde M^3 = 0\).
ℓ-distant Hamiltonian walks in Cartesian product graphs
2009
Abstract We introduce and study a generalisation of Hamiltonian cycles: an l-distant Hamiltonian walk in a graph G of order n is a cyclic ordering of its vertices in which consecutive vertices are at distance l. Conditions for a Cartesian product graph to possess such an l-distant Hamiltonian walk are given and more specific results are presented concerning toroidal grids.
Finite groups with subgroups supersoluble or subnormal
2009
Abstract The aim of this paper is to study the structure of finite groups whose non-subnormal subgroups lie in some subclasses of the class of finite supersoluble groups.
Gaussian Groups and Garside Groups, Two Generalisations of Artin Groups
1999
It is known that a number of algebraic properties of the braid groups extend to arbitrary finite Coxeter-type Artin groups. Here we show how to extend the results to more general groups that we call Garside groups. Define a Gaussian monoid to be a finitely generated cancellative monoid where the expressions of a given element have bounded lengths, and where left and right lowest common multiples exist. A Garside monoid is a Gaussian monoid in which the left and right lowest common multiples satisfy an additional symmetry condition. A Gaussian group is the group of fractions of a Gaussian monoid, and a Garside group is the group of fractions of a Garside monoid. Braid groups and, more genera…
An algorithm for the Rural Postman problem on a directed graph
1986
The Directed Rural Postman Problem (DRPP) is a general case of the Chinese Postman Problem where a subset of the set of arcs of a given directed graph is ‘required’ to be traversed at minimum cost. If this subset does not form a weakly connected graph but forms a number of disconnected components the problem is NP-Complete, and is also a generalization of the asymmetric Travelling Salesman Problem. In this paper we present a branch and bound algorithm for the exact solution of the DRPP based on bounds computed from Lagrangean Relaxation (with shortest spanning arborescence sub-problems) and on the fathoming of some of the tree nodes by the solution of minimum cost flow problems. Computation…
The Structure Group and the Permutation Group of a Set-Theoretic Solution of the Quantum Yang–Baxter Equation
2021
We describe the left brace structure of the structure group and the permutation group associated to an involutive, non-degenerate set-theoretic solution of the quantum YangBaxter equation by using the Cayley graph of its permutation group with respect to its natural generating system. We use our descriptions of the additions in both braces to obtain new properties of the structure and the permutation groups and to recover some known properties of these groups in a more transparent way.