Zobrazeno 1 - 6
of 6
pro vyhledávání: '"Andrea Schumm"'
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:
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:
Journal of Graph Algorithms and Applications
Journal of Graph Algorithms and Applications, Brown University, 2012, 16 (2), ⟨10.7155/jgaa.00270⟩
Journal of Graph Algorithms and Applications, 2012, 16 (2), ⟨10.7155/jgaa.00270⟩
Journal of Graph Algorithms and Applications, Brown University, 2012, 16 (2), ⟨10.7155/jgaa.00270⟩
Journal of Graph Algorithms and Applications, 2012, 16 (2), ⟨10.7155/jgaa.00270⟩
International audience; We study a graph-augmentation problem arising from a technique applied in recent approaches for route planning. Many such methods enhance the graph by inserting shortcuts, i.e., additional edges (u,v) such that the length of (
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::e9cd1c0c1a2c6556ff3c603ba39dfafd
https://hal.inria.fr/hal-00728877
https://hal.inria.fr/hal-00728877
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
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642348617
MedAlg
MedAlg
A planted partition graph is an Erdős-Renyi type random graph, where, based on a given partition of the vertex set, vertices in the same part are linked with a higher probability than vertices in different parts. Graphs of this type are frequently u
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::db259b0e21020ee0afc7230dbcbce73e
https://doi.org/10.1007/978-3-642-34862-4_16
https://doi.org/10.1007/978-3-642-34862-4_16
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642222993
WADS
WADS
Clusterings of graphs are often constructed and evaluated with the aid of a quality measure. Numerous such measures exist, some of which adapt an established measure for graph cuts to clusterings. In this work we pursue the problem of finding cluster
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::90f7cd278765b462210af5bedf5970b0
https://doi.org/10.1007/978-3-642-22300-6_58
https://doi.org/10.1007/978-3-642-22300-6_58