Searching for authors named "Gottfried Tinhofer" – sorted by Relevance.
11 documents found, showing 1 through 10.
Next 10 →
-
Packing Under Tolerance Constraints
- …Let N = f1; 2; : : : ; ng and c 2 R n : A k-tuple (t 1 ; : : : ; t k ) of elements in N is called an acceptable cell if \Gamma1 k X i=1 c t i 1: We consider the problems of (i) finding the set T of all acceptable cells efficiently (ii) finding a maximum number of mutually disjoint acceptabl…
- Add To MetaCart
-
Algebraic Combinatorics in Mathematical Chemistry. Methods and Algorithms. I. Permutation Groups and Coherent (Cellular) Algebras.
- …Contents 3 Problems related to the perception of the symmetry of chemical graphs 4 Fundamentals of permutation group theory 5 Centralizer algebras of permutation groups 6 Cellular algebras 7 Galois correspondence between permutation groups and cellular algebras 8 S-rings over cyclic groups …
- Cited by 15 (4 self) – Add To MetaCart
-
The Graph
- …Technische Universit "at…
- Add To MetaCart
-
Investigation of Hydrogen Bond Patterns: The Graph Set Approach. Part I: General Ideas and Their Application to Crystal Structures With Exactly One Molecule in the . . .
- …The first part of this paper deals with a graph-theoretical reformulation of the elements of graph set analysis for describing hydrogen bond patterns in crystal structures. We collect a number of mathematical tools which are convenient for this purpose, -- like crystal stucture graph, H-bond graph, …
- Add To MetaCart
-
Recognizing circulant graphs in polynomial time: an application of association schemes
- …In this paper we present a time-polynomial recognition algorithm for certain classes of circulant graphs. Our approach uses coherent congurations and Schur rings generated by circulant graphs for elucidating their symmetry properties and eventually nding a cyclic automorphism. Key words: Circulant g…
- Cited by 2 (0 self) – Add To MetaCart
-
STABCOL: Graph Isomorphism Testing Based on the Weisfeiler-Leman Algorithm
- …A coherent algebra is a matrix algebra over the field of the complex numbers which is closed under conjugate transposition and elementwise multiplication of matrices and which contains the identity matrix and the all 1 matrix. This algebraic structure has a variety of important applications. Among o…
- Cited by 8 (3 self) – Add To MetaCart
-
On a New Class of Weakly Compact Graphs
- …In this paper we introduce and investigate a new class of graphs called algebraic forests for which isomorphism testing can be done in time O(n 3 log n). The class of algebraic forests admits a membership test of the same complexity, it includes cographs, trees and interval graphs, and even a join…
- Cited by 2 (1 self) – Add To MetaCart
-
Landscapes on Spaces of Trees
- …Combinatorial optimization problems defined on sets of phylogenetic trees are an important issue in computational biology, for instance the problem of reconstruction a phylogeny using maximum likelihood or parsimony approaches. The collection of possible phylogenetic trees is arranged as a so-called…
- Cited by 5 (1 self) – Add To MetaCart
-
Some Properties of Robinson Graphs
- …Robinson graphs are configuration graphs over sets of phylogenetic trees. Their neighbor relation is given by all possible crossovers along inner edges of these trees. We show that Robinson graphs generate coherent algebras the cell partition of which equals the automorphism partition. Each cell con…
- Cited by 2 (1 self) – Add To MetaCart
-
Bond Patterns. Some Mathematical
- …Univ. M"unc hen, Fak. f. Math, Rep ort TUM M9908 (99) Mathematics Sub ject Classification:05C25 Editor: H. W"ahling…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
