Filters








130,118 Hits in 6.4 sec

A Faster Algorithm for Fully Dynamic Betweenness Centrality [article]

Matteo Pontecorvi, Vijaya Ramachandran
<span title="2015-11-25">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We present a new fully dynamic algorithm for maintaining betweenness centrality (BC) of vertices in a directed graph G=(V,E) with positive edge weights.  ...  This result improves on the amortized bound for fully dynamic BC in [Pontecorvi-Ramachandran2015] by a logarithmic factor.  ...  We develop a faster fully dynamic algorithm for APASP, which in turn leads to a faster fully dynamic BC algorithm than PR. Our Results.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1506.05783v3">arXiv:1506.05783v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/is6mgwy245cu7nw6ptwqlo3gea">fatcat:is6mgwy245cu7nw6ptwqlo3gea</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200908023745/https://arxiv.org/pdf/1506.05783v3.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/a2/d1/a2d1cfb58bf5aad5a5cd74e05d76c7b4c02e4026.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1506.05783v3" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Recent Advances in Fully Dynamic Graph Algorithms [article]

Kathrin Hanauer, Monika Henzinger, Christian Schulz
<span title="2021-07-01">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Here, we present a quick reference guide to recent engineering and theory results in the area of fully dynamic graph algorithms.  ...  In recent years, significant advances have been made in the design and analysis of fully dynamic algorithms.  ...  For some classical dynamic algorithms, experimental studies have been performed, such as for fully dynamic graph clustering [80] and fully dynamic approximation of betweenness centrality [35] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2102.11169v5">arXiv:2102.11169v5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tcs3lkgcg5f7jax672adyzrstm">fatcat:tcs3lkgcg5f7jax672adyzrstm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210707013400/https://arxiv.org/pdf/2102.11169v5.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/61/d6/61d68c426c932ad42c76f8a83e0c2678fd6e376f.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2102.11169v5" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Dynamic Laplace: Efficient Centrality Measure for Weighted or Unweighted Evolving Networks [article]

Mário Cordeiro, Pavel Brazdil Doctoral Program in Informatics Engineering - Faculty of Engineering at University of Porto, INESC TEC - Institute for Systems and Computer Engineering Technology and Science)
<span title="2018-08-08">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Incremental and dynamic versions of centrality measures are starting to emerge (betweenness, closeness, etc).  ...  Recently, the need to apply such centrality algorithms to non static networks (i.e.: networks that evolve over time) is also a new challenge.  ...  project POCI-01-0145-FEDER-006961, and by National Funds through the FCT -Fundação para a Ciência e a Tecnologia (Portuguese Foundation for Science and Technology) as part of project UID/EEA/50014/2013  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1808.02960v1">arXiv:1808.02960v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ln4iygshbffivcphm5ki7qc6bu">fatcat:ln4iygshbffivcphm5ki7qc6bu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20191024151850/https://arxiv.org/pdf/1808.02960v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/82/e6/82e6a12f7861ea6a1396e2c05574fe89bccbd68d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1808.02960v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Efficient algorithms for updating betweenness centrality in fully dynamic graphs

Min-Joong Lee, Sunghee Choi, Chin-Wan Chung
<span title="">2016</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ozlq63ehnjeqxf6cuxxn27cqra" style="color: black;">Information Sciences</a> </i> &nbsp;
In this paper, we study the update problem of betweenness centrality in fully dynamic graphs.  ...  Betweenness centrality of a vertex (edge) in a graph is a measure for the relative participation of the vertex (edge) in the shortest paths in the graph.  ...  for updating betweenness centrality in fully dynamic graphs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ins.2015.07.053">doi:10.1016/j.ins.2015.07.053</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/je75jmmpwzaadji4y3za4s626i">fatcat:je75jmmpwzaadji4y3za4s626i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829003629/http://islab.kaist.ac.kr/bc.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/5a/b7/5ab77d0a2a67311163659a15e13d45cc7ac6b36a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ins.2015.07.053"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Fully Self-Consistent N-body Simulation of Star Cluster in the Galactic Center

M. Fujii, M. Iwasawa, Y. Funato, J. Makino
<span title="">2007</span> <i title="Cambridge University Press (CUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/djnl2eulfjdwxplyqzspykhc2m" style="color: black;">Proceedings of the International Astronomical Union</a> </i> &nbsp;
AbstractWe have developed a new tree-direct hybrid algorithm, "Bridge". It can simulate small scale systems embedded within large-N systems fully self-consistently.  ...  " simulations, in which the orbital evolution of the star clusters is calculated from the dynamical friction formula.  ...  Therefore, a fully self-consistent N -body simulation is necessary. However, such a fully self-consistent N -body simulation has been impossible with conventional numerical methods.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s1743921308016177">doi:10.1017/s1743921308016177</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rpji2wd7jjdqniakchvcgf5hqi">fatcat:rpji2wd7jjdqniakchvcgf5hqi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190504224726/https://www.cambridge.org/core/services/aop-cambridge-core/content/view/6774A02FE6133B3349CA348FAB1C6BFD/S1743921308016177a.pdf/div-class-title-fully-self-consistent-span-class-italic-n-span-body-simulation-of-star-cluster-in-the-galactic-center-div.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/91/3c/913c86a01a2ad3cfb34041a7e4581a6a17c8df93.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1017/s1743921308016177"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> cambridge.org </button> </a>

Faster Betweenness Centrality Updates in Evolving Networks [article]

Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann, Arie Slobbe
<span title="2017-04-27">2017</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this paper we introduce a new dynamic algorithm for updating betweenness centrality after an edge insertion or an edge weight decrease.  ...  For betweenness, several dynamic algorithms have been proposed over the years, targeting different update types (incremental- and decremental-only, fully-dynamic).  ...  We present a new algorithm for updating betweenness centrality after an edge insertion or an edge weight decrease.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1704.08592v1">arXiv:1704.08592v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kuz2fdd3vjby5h6tukiegurn7e">fatcat:kuz2fdd3vjby5h6tukiegurn7e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200831221909/https://arxiv.org/pdf/1704.08592v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d0/66/d06675df3a0647dc82a49f0f2e85754f703fe236.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1704.08592v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

A New Logistic Dynamic Particle Swarm Optimization Algorithm Based on Random Topology

Qingjian Ni, Jianming Deng
<span title="">2013</span> <i title="Hindawi Limited"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/nxzqpsogkbe55mjq33syzghf2e" style="color: black;">The Scientific World Journal</a> </i> &nbsp;
And about the design and use of population topology on PSO, some useful conclusions are proposed which can provide a basis for further discussion and research.  ...  Further, in a relatively new PSO variant which named logistic dynamic particle optimization, an extensive simulation study is presented to discuss the effectiveness of the random topology and the design  ...  Acknowledgments This paper is supported by Provincial Key Laboratory for Computer Information Processing Technology, Soochow University, Suzhou, China, and NSFC (Grant no. 61170164).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2013/409167">doi:10.1155/2013/409167</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/23818820">pmid:23818820</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC3683496/">pmcid:PMC3683496</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zoyb5ongvbh4zeqb36xqyapxha">fatcat:zoyb5ongvbh4zeqb36xqyapxha</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190307085809/http://pdfs.semanticscholar.org/d425/baa2b1750814ebe6797c3fcc3f26df8f3776.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d4/25/d425baa2b1750814ebe6797c3fcc3f26df8f3776.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1155/2013/409167"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> hindawi.com </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3683496" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

Faster Fully Dynamic Transitive Closure in Practice

Kathrin Hanauer, Monika Henzinger, Christian Schulz, Domenico Cantone, Simone Faro
<span title="">2020</span> <i title="Schloss Dagstuhl - Leibniz-Zentrum für Informatik"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/lz6rlossxffpddtscflx56wpb4" style="color: black;">Symposium on Experimental and Efficient Algorithms</a> </i> &nbsp;
The fully dynamic transitive closure problem asks to maintain reachability information in a directed graph between arbitrary pairs of vertices, while the graph undergoes a sequence of edge insertions and  ...  In two large studies [Frigioni ea, 2001; Krommidas and Zaroliagis, 2008], a number of these algorithms have been evaluated experimentally against simple, static algorithms for graph traversal, showing  ...  The classic static algorithms BFS and DFS, which were competitive or even superior to the dynamic algorithms evaluated experimentally in previous studies, lagged far behind the new algorithms and were  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.sea.2020.14">doi:10.4230/lipics.sea.2020.14</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/wea/HanauerH020.html">dblp:conf/wea/HanauerH020</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/upqg4kcgmjewfjbx4qaeft6dve">fatcat:upqg4kcgmjewfjbx4qaeft6dve</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201214064928/https://drops.dagstuhl.de/opus/volltexte/2020/12088/pdf/LIPIcs-SEA-2020-14.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f4/65/f4650cb0703c72aab95c9429bf9c7d167ccd2291.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.sea.2020.14"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Centrality Measures: A Tool to Identify Key Actors in Social Networks [article]

Rishi Ranjan Singh
<span title="2020-11-03">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Experts from several disciplines have been widely using centrality measures for analyzing large as well as complex networks.  ...  In this chapter, we summarize some of the centrality measures that are extensively applied for mining social network data. We also discuss various directions of research related to these measures.  ...  Pontecorvi and Ramachandran [138] gave a fully dynamic algorithm for updating APASPs and extended the algorithm to develop a fully dynamic approach to update betweenness scores [140, 139] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2011.01627v1">arXiv:2011.01627v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hsocyivf5jgstkled67osd6w6q">fatcat:hsocyivf5jgstkled67osd6w6q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201107234739/https://arxiv.org/pdf/2011.01627v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/59/6d/596d842896c5f5c37d1846bd2747d88b610bfabb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2011.01627v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Fully Dynamic Betweenness Centrality [chapter]

Matteo Pontecorvi, Vijaya Ramachandran
<span title="">2015</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We present fully dynamic algorithms for maintaining betweenness centrality (BC) of vertices in a directed graph G = (V, E) with positive edge weights.  ...  Our first algorithm also contains within it, a method and analysis for obtaining fully dynamic APSP from a decremental algorithm, that differs from the one in [8] .  ...  The Fully Dynamic Betweenness Centrality Algorithm The static Brandes algorithm [5] computes BC scores in a two phase process.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-48971-0_29">doi:10.1007/978-3-662-48971-0_29</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yh7hl4aapvgijgcajrvbejnqym">fatcat:yh7hl4aapvgijgcajrvbejnqym</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190309025520/http://pdfs.semanticscholar.org/f26b/350beee2e77e8c075e8c8eb2efb38c6d4cd2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f2/6b/f26b350beee2e77e8c075e8c8eb2efb38c6d4cd2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-48971-0_29"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Fully-dynamic Approximation of Betweenness Centrality [article]

Elisabetta Bergamini, Henning Meyerhenke
<span title="2015-07-03">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths.  ...  In this paper we propose the first fully-dynamic approximation algorithms (for weighted and unweighted undirected graphs that need not to be connected) with a provable guarantee on the maximum approximation  ...  This work is partially supported by DFG grant FINCA (ME-3619/3-1) within the SPP 1736 Algorithms for Big Data.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1504.07091v2">arXiv:1504.07091v2</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zhe7ockhavbn7kywum725wzf2y">fatcat:zhe7ockhavbn7kywum725wzf2y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200912160620/https://arxiv.org/pdf/1504.07091v2.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ea/0b/ea0b023d859230fc5788b1656e21c02b7637cca5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1504.07091v2" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

k-t FASTER: Acceleration of functional MRI data acquisition using low rank constraints

Mark Chiew, Stephen M. Smith, Peter J. Koopmans, Nadine N. Graedel, Thomas Blumensath, Karla L. Miller
<span title="2014-08-28">2014</span> <i title="Wiley"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/34p2n5u2vjfgrf7j2rmkmfhogu" style="color: black;">Magnetic Resonance in Medicine</a> </i> &nbsp;
We present a novel method for accelerating FMRI data acquisition, k--t FASTER (FMRI Accelerated in Space--time via Truncation of Effective Rank), which exploits the low--rank structure of FMRI data.  ...  Methods: Using matrix completion, 4.27x retrospectively and prospectively under-sampled data were reconstructed (coil--independently) using an iterative nonlinear algorithm, and compared to a number of  ...  We are very grateful to Kamil Ugurbil, Essa Yacoub, Steen Moeller and Eddie Auerbach for providing the multiband software.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/mrm.25395">doi:10.1002/mrm.25395</a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pubmed/25168207">pmid:25168207</a> <a target="_blank" rel="external noopener" href="https://pubmed.ncbi.nlm.nih.gov/PMC4682483/">pmcid:PMC4682483</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/shdlqqk6zbaivl32mscdsacrsq">fatcat:shdlqqk6zbaivl32mscdsacrsq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190428131344/https://eprints.soton.ac.uk/367800/1/CSKGBM_MRM14.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f2/98/f2985a7ac70f8bb40d858dcf502f5aea80ab9448.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1002/mrm.25395"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> wiley.com </button> </a> <a target="_blank" rel="external noopener" href="https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4682483" title="pubmed link"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> pubmed.gov </button> </a>

Multicast Tree Diameter for Dynamic Distributed Interactive Applications

K.-H. Vik, P. Halvorsen, C. Griwodz
<span title="">2008</span> <i title="IEEE"> 2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications </i> &nbsp;
Such applications may have stringent latency requirements and dynamic user groups. We focus on using application-layer multicast with a centralized approach to the group management.  ...  We investigate many spanning tree problems with particular focus on reducing the diameter of a tree, i.e., the maximum pairwise latency between users.  ...  The users are divided into groups and the central entity stores a fully meshed group graph for each group. A group graph is a subgraph of the global graph.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/infocom.2007.220">doi:10.1109/infocom.2007.220</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5bnuzp3msvgwbddshhasylizfa">fatcat:5bnuzp3msvgwbddshhasylizfa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808051902/http://home.ifi.uio.no/paalh/publications/files/infocom08.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fe/55/fe55eae32479396f80a1a05ccba8f733ecb10091.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/infocom.2007.220"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Multicast Tree Diameter for Dynamic Distributed Interactive Applications

K.-H. Vik, P. Halvorsen, C. Griwodz
<span title="">2008</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2n2fyi4qgfa53mwrtarkk6ysnm" style="color: black;">IEEE INFOCOM 2008 - The 27th Conference on Computer Communications</a> </i> &nbsp;
Such applications may have stringent latency requirements and dynamic user groups. We focus on using application-layer multicast with a centralized approach to the group management.  ...  We investigate many spanning tree problems with particular focus on reducing the diameter of a tree, i.e., the maximum pairwise latency between users.  ...  The users are divided into groups and the central entity stores a fully meshed group graph for each group. A group graph is a subgraph of the global graph.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/infocom.2008.220">doi:10.1109/infocom.2008.220</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/infocom/VikHG08.html">dblp:conf/infocom/VikHG08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vnxand6hh5as5cmzyo2da7qcxm">fatcat:vnxand6hh5as5cmzyo2da7qcxm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170808051902/http://home.ifi.uio.no/paalh/publications/files/infocom08.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/fe/55/fe55eae32479396f80a1a05ccba8f733ecb10091.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/infocom.2008.220"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Approximating Betweenness Centrality in Fully Dynamic Networks

Elisabetta Bergamini, Henning Meyerhenke
<span title="2016-04-22">2016</span> <i title="Internet Mathematics"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/btilruk4pjav5n4cm5wszidqtm" style="color: black;">Internet Mathematics</a> </i> &nbsp;
In this article, we propose the first betweenness centrality approximation algorithms with a provable guarantee on the maximum approximation error for dynamic networks.  ...  Betweenness is a well-known centrality measure that ranks the nodes of a network according to their participation in shortest paths.  ...  ACKNOWLEDGMENTS We thank Moritz von Looz for providing the synthetic dynamic networks and the numerous contributors to the NetworKit project.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/15427951.2016.1177802">doi:10.1080/15427951.2016.1177802</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gr6zvp4bkbd25jbl2spg4tyzaq">fatcat:gr6zvp4bkbd25jbl2spg4tyzaq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200314051618/https://www.internetmathematicsjournal.com/article/1607.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/00/aa/00aadcb9abe447e979ab4b30f3cf7a8a8f43c410.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1080/15427951.2016.1177802"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 130,118 results