Zobrazeno 1 - 10
of 68
pro vyhledávání: '"E. Dahlhaus"'
Publikováno v:
Discrete Applied Mathematics. 131(1):151-167
For a graph G with weight function w on the vertices, the total distance of G is the sum over all unordered pairs of vertices x and y of w(x)w(y) times the distance between x and y. A MAD tree of G is a spanning tree with minimum total distance. We d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::202e7c7750b5348f2593e7283f6e3a03
Publikováno v:
SIAM Journal on Computing. 23:864-894
In the multiterminal cut problem one is given an edge-weighted graph and a subset of the vertices called terminals, and is asked for a minimum weight set of edges that separates each terminal from all the others. When the number $k$ of terminals is t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f465ead4c252e74300f959521dcae004
https://doi.org/10.1137/s0097539792225297
https://doi.org/10.1137/s0097539792225297
Autor:
E. Dahlhaus
Publikováno v:
SPDP
A fast parallel algorithm of single link heuristics of hierarchical clustering is presented. Its time processor product is optimal and the parallel time is the square of the logarithm. The algorithm is based on computing a minimum spanning tree which
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e61fce12dd9aa1570ff4d6d3a5bcacb
https://doi.org/10.1109/spdp.1992.242746
https://doi.org/10.1109/spdp.1992.242746
Autor:
E. Dahlhaus
Publikováno v:
ICCI
A parallel algorithm is developed which recognizes parity graphs in O(log/sup 2/ n) time using a linear number of processors. This improves previous results of G. Adhar and S. Peng (J. Algorithms, vol. 11, pp. 252-284, 1990) and of T. Przytycka and D
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2910111f1a8602bcd65eb0164f9b6872
https://doi.org/10.1109/icci.1993.315399
https://doi.org/10.1109/icci.1993.315399
Autor:
E. Dahlhaus
Publikováno v:
HICSS (1)
Presents simple parallel algorithms to recognize hypergraphs with the property that the vertices can be ordered so that the hyperedges form intervals. The algorithm circumvents P-Q-trees and is a simplification of the algorithm of Klein and Reif (198
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02b8d94daf7618bca3d9de7d873543b7
https://doi.org/10.1109/hicss.1997.667212
https://doi.org/10.1109/hicss.1997.667212
Publikováno v:
STOC
In the Multiway Cut problem we are given an edge-weighted graph and a subset of the vertices called terminals, and asked for a minimum weight set of edges that separates each terminal from all the others. When the number k of terminals is two, this i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::54bc36ed5914ef7b61469fdaf34bcdb4
https://doi.org/10.1145/129712.129736
https://doi.org/10.1145/129712.129736
Autor:
H Gaifman, E Dahlhaus
Publikováno v:
Theoretical Computer Science. 41:169-184
This paper presents a negative solution of the problem whether 2-adjacent context-free languages and context-free languages coincide. Moreover, we compare this language type with E0L-languages.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3031f7b5b7c6fbb452cd985dc6e57385
https://doi.org/10.1016/0304-3975(85)90069-6
https://doi.org/10.1016/0304-3975(85)90069-6
Autor:
E. Dahlhaus, Johann A. Makowsky
Publikováno v:
Information and Computation. (1):1-32
We generalize relational data bases such as to include also hierarchic structures in the form of directories of relations and directories of directories. In this framework we study computable directory transformations which generalize the computable
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5c04d9191340752a9c4914a1a97ff731
Kniha
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Kniha
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.