Zobrazeno 1 - 10
of 26
pro vyhledávání: '"Robert Görke"'
Publikováno v:
Informatik-Spektrum. 36:144-152
Algorithm Engineering fur Graphclustern beinhaltet mehr als die Entwicklung gut funktionierender Algorithmen fur konkrete Anwendungen oder Datensatze. Es geht vielmehr um den systematischen Entwurf von Algorithmen fur formal sauber gefasste Probleme
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91c897d239eb2ded69cb603749de021c
https://doi.org/10.1007/s00287-013-0685-0
https://doi.org/10.1007/s00287-013-0685-0
Publikováno v:
Journal of Graph Algorithms and Applications. 16:411-446
Algorithms or target functions for graph clustering rarely admit quality guarantees or optimal results in general. Based on properties of minimum-cut trees, a clustering algorithm by Flake et al. does however yield such a provable guarantee. We show
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c54dab790c4244144840b1fa0a27e057
https://doi.org/10.7155/jgaa.00269
https://doi.org/10.7155/jgaa.00269
Publikováno v:
Journal of Graph Algorithms and Applications. 14:165-197
We formally state and investigate the lucidity paradigm for graph clusterings. The rationale that substantiates this concept is the trade-off between the achieved quality and the expected quality of a graph clustering. A recently defined quality meas
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::1a775b69c11d48d808d4e34a737c0215
https://doi.org/10.7155/jgaa.00203
https://doi.org/10.7155/jgaa.00203
Publikováno v:
Networks & Heterogeneous Media. 3:277-294
The modeling of realistic networks is of prime importance for modern complex systems research. Previous procedures typically model the natural growth of networks by means of iteratively adding nodes, geometric positioning information, a definition of
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::43d819e59cf0faf3c4f966b7a0763b62
https://doi.org/10.3934/nhm.2008.3.277
https://doi.org/10.3934/nhm.2008.3.277
Publikováno v:
International Journal of Computational Geometry and Applications, 18(4), 275-294. World Scientific
Abstracts 21th European Workshop on Computational Geometry (EWCG 2005, Eindhoven, The Netherlands, March 9-11, 2005), 155-158
STARTPAGE=155;ENDPAGE=158;TITLE=Abstracts 21th European Workshop on Computational Geometry (EWCG 2005, Eindhoven, The Netherlands, March 9-11, 2005)
Abstracts 21th European Workshop on Computational Geometry (EWCG 2005, Eindhoven, The Netherlands, March 9-11, 2005), 155-158
STARTPAGE=155;ENDPAGE=158;TITLE=Abstracts 21th European Workshop on Computational Geometry (EWCG 2005, Eindhoven, The Netherlands, March 9-11, 2005)
Given a set P of n point sites in the plane, the city Voronoi diagram subdivides the plane into the Voronoi regions of the sites, with respect to the city metric. This metric is induced by quickest paths according to the Manhattan metric and an accel
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b248cf41a99fdcb67982e3e86adeb9af
https://doi.org/10.1142/s0218195908002623
https://doi.org/10.1142/s0218195908002623
Publikováno v:
SPIE Proceedings.
This paper presents novel graph algorithms and modern control solutions applied to the graph networks resulting from specific experiments to discover disease-related pathways and drug targets in glioma cancer stem cells (GSCs). The theoretical framew
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::860e2cfde4c739f1f0c66d571a333397
https://doi.org/10.1117/12.2019381
https://doi.org/10.1117/12.2019381
Publikováno v:
ACM Journal of Experimental Algorithmics. 18
Maximizing the quality index modularity has become one of the primary methods for identifying the clustering structure within a graph. Since many contemporary networks are not static but evolve over time, traditional static approaches can be inapprop
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::601944bf33b4584edce4a2d23f6b881d
https://doi.org/10.1145/2444016.2444021
https://doi.org/10.1145/2444016.2444021
Publikováno v:
Graph Drawing ISBN: 9783642367625
Graph Drawing
Graph Drawing
Large graphs appear in many application domains. Their analysis can be done automatically by machines, for which the graph size is less of a problem, or, especially for exploration tasks, visually by humans. The graph drawing literature contains many
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9cab5db5e1d24e71dc56915c61cecafb
https://doi.org/10.1007/978-3-642-36763-2_49
https://doi.org/10.1007/978-3-642-36763-2_49
Publikováno v:
ASONAM
Collaboration networks arise when we map the connections between scientists which are formed through joint publications. These networks thus display the social structure of academia, and also allow conclusions about the structure of scientific knowle
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d37f6b205a5219a35277211c5ae5bb10
https://doi.org/10.1109/asonam.2012.90
https://doi.org/10.1109/asonam.2012.90
Publikováno v:
2012 Proceedings of the Fourteenth Workshop on Algorithm Engineering and Experiments (ALENEX) ISBN: 9781611972122
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d4d2c1d72b5868028952d4cb05f77a1b
https://doi.org/10.1137/1.9781611972924.1
https://doi.org/10.1137/1.9781611972924.1