Zobrazeno 1 - 10
of 55
pro vyhledávání: '"G. Tinhofer"'
Publikováno v:
Acta Crystallographica Section B Structural Science. 55:1030-1043
To provide a foundation for further theoretical and software development of the application of graph sets to patterns of hydrogen bonding and other intermolecular interactions a number of mathematical concepts and tools are defined, developed and dem
Publikováno v:
ZOR Zeitschrift f�r Operations Research Mathematical Methods of Operations Research. 40:334-338
Autor:
G. Tinhofer, E. Farnbacher
Publikováno v:
System Modelling and Optimization ISBN: 9783540555773
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7bc3884c2f73fc32c612c19843617ea5
https://doi.org/10.1007/bfb0113288
https://doi.org/10.1007/bfb0113288
Publikováno v:
Acta crystallographica. Section B, Structural science. 56(Pt 1)
Owing to a serious printing error, this article [Grell et al. (1999). Acta Cryst. B55, 1030–1043] was printed incorrectly. Pages 1029–1044 have thus been reprinted and included as a loose insert with this issue of the journal.
Publikováno v:
Computing Supplementum ISBN: 9783211821770
Computational Graph Theory
Computational Graph Theory
Efficient Computations in Tree-Like Graphs.- Graph Problems Related to Gate Matrix Layout and PLA Folding.- Planar Graph Problems.- Basic Parallel Algorithms in Graph Theory.- Applications of Parallel Scheduling Algorithms to Families of Perfect Grap
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::69b8da3f23c54bb95f4415a72cdc89ea
https://doi.org/10.1007/978-3-7091-9076-0
https://doi.org/10.1007/978-3-7091-9076-0
Autor:
G. Tinhofer
Publikováno v:
Computing Supplementum ISBN: 9783211821770
Generating Graphs Uniformly at Random. This paper deals with the problem of sampling from a uniform distribution on various classes of graphs of given size. We consider algorithms and restarting procedures for uniform generation of several kinds of t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::173231f11cee8fc8ecf0e125ecce0fe1
https://doi.org/10.1007/978-3-7091-9076-0_12
https://doi.org/10.1007/978-3-7091-9076-0_12
Publikováno v:
Zeitschrift für Operations Research. 32:107-110
Autor:
H Schreck, G Tinhofer
Publikováno v:
Information Processing Letters. 23:11-17
Autor:
G. Tinhofer, H. Schreck
Publikováno v:
Linear Algebra and its Applications. 111:125-134
For a nonempty and noncomplete circulant graph G on a prime number n of vertices with adjacency matrix A , consider the polytope DS( G ) of all doubly stochastic matrices X which commute with A . It is shown that DS( G ) is integral iff the spectral