Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Gottfried Tinhofer"'
Publikováno v:
Applied Mathematics and Computation. 131:439-459
Combinatorial optimization problems defined on sets of phylogenetic trees are an important issue in computational biology, for instance the problem of reconstructing a phylogeny using maximum likelihood or parsimony approaches. The collection of poss
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::244c0453eabeca5bdfb3c15c1d3343d7
https://doi.org/10.1016/s0096-3003(01)00164-3
https://doi.org/10.1016/s0096-3003(01)00164-3
Publikováno v:
Crystallography Reviews. 8:1-56
In this paper we review a graph-theoretical reformulation of the elements of graph set analysis for describing hydrogen bond patterns in crystal structures. We first collect a number of mathematical tools which are convenient for this purpose such as
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64ac95b92c61584b2c9ba9fc188945d6
https://doi.org/10.1080/08893110211936
https://doi.org/10.1080/08893110211936
One ofthe most important aspects in research fields where mathematics is'applied is the construction of a formal model of a real system. As for structural relations, graphs have turned out to provide the most appropriate tool for setting up the mathe
Publikováno v:
Journal of Algorithms. 21:542-564
This paper deals with the isomorphism problem of directed path graphs and rooted directed path graphs. Both graph classes belong to the class of chordal graphs, and for both classes the relative complexity of the isomorphism problem is yet unknown. W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::66d1db0314dff44d7ed73b64017e00f4
https://doi.org/10.1006/jagm.1996.0058
https://doi.org/10.1006/jagm.1996.0058
Publikováno v:
Computing. 54:213-225
In a recent series of articles R. Jamison and S. Olariu developed, starting from an extension of the notion of a cograph, a theory of the decomposition of graphs intoP 4-connected components. It turned out in their work that the algorithmic idea to e
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::df333182f4db283ce05360ab8b8d6bb1
https://doi.org/10.1007/bf02253613
https://doi.org/10.1007/bf02253613
Autor:
Luitpold Babel, Gottfried Tinhofer
Publikováno v:
Discrete Applied Mathematics. 51(1-2):3-25
The sequential coloring method colors the vertices of a graph in a given order assigning each vertex the smallest available color. A sequential coloring is called connected-coloring if at any time the colored vertices induce a connected graph. A grap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::17fb19f908ebd69083168aaa98b1b70c
Autor:
Gottfried Tinhofer
Publikováno v:
Discrete Applied Mathematics. 30:253-264
An undirected simple graph G is called compact iff its adjacency matrix A is such that the polytope S(A) of doubly stochastic matrices X which commute with A has integral-valued extremal points only. We show that the isomorphism problem for compact g
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a300191121fd6c9eeefe66c0299cfedb
https://doi.org/10.1016/0166-218x(91)90049-3
https://doi.org/10.1016/0166-218x(91)90049-3
Autor:
Gottfried Tinhofer, Luitpold Babel
Publikováno v:
ZOR Zeitschrift f�r Operations Research Methods and Models of Operations Research. 34:207-217
We present a branch and bound algorithm for the maximum clique problem in arbitrary graphs. The main part of the algorithm consists in the determination of upper bounds by graph colorings. Using a modification of a known graph coloring method called
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a95b901c5563a6d532d046d6b7e7ef7a
https://doi.org/10.1007/bf01415983
https://doi.org/10.1007/bf01415983
Autor:
Mikhail Muzychuk, Gottfried Tinhofer
Publikováno v:
The Electronic Journal of Combinatorics. 8
In this paper we present a time-polynomial recognition algorithm for certain classes of circulant graphs. Our approach uses coherent configurations and Schur rings generated by circulant graphs for elucidating their symmetry properties and eventually
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f4f0ca4c2abc39823e39db973439f4d9
https://doi.org/10.37236/1570
https://doi.org/10.37236/1570
Autor:
Mikhail Muzychuk, Gottfried Tinhofer
Publikováno v:
The Electronic Journal of Combinatorics. 5
A circulant graph $G$ of order $n$ is a Cayley graph over the cyclic group ${\bf Z}_n.$ Equivalently, $G$ is circulant iff its vertices can be ordered such that the corresponding adjacency matrix becomes a circulant matrix. To each circulant graph we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5de5312b9684e1350926f8d5457af0ef
https://doi.org/10.37236/1363
https://doi.org/10.37236/1363