A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Incremental closeness centrality in distributed memory
2015
Parallel Computing
Preserved Fulltext
In this paper, we propose Streamer, a distributed memory framework for incrementally maintaining the closeness centrality scores of a network upon changes. ...
The best known algorithm to compute the CC scores makes it impractical to recompute them from scratch after each modification. ...
To be able to do that, the incremental algorithms main-tain complex information such as the biconnected component decomposition of the current graph [25] . ...
doi:10.1016/j.parco.2015.01.003
fatcat:klbizqhklnh5vnls3zx25bdxfe
Monitor placement for maximal identifiability in network tomography
2014
IEEE INFOCOM 2014 - IEEE Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
The basis to our solution is an efficient algorithm for determining all identifiable links for a given monitor placement. ...
Based on this algorithm, we develop a polynomial-time greedy algorithm to incrementally place monitors such that each newly placed monitor maximizes the number of additional identifiable links. ...
There exist fast algorithms to decompose an arbitrary graph G into biconnected components [16] and then triconnected components [17] . ...
doi:10.1109/infocom.2014.6848079
dblp:conf/infocom/MaHLST14
fatcat:gosuppw7pnd5ln4t7qw5gbd6te
An experimental comparison of four graph drawing algorithms
1997
Computational geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we present an extensive experimental study comparing four general-purpose graph drawing algorithms. ...
The four algorithms take as input general graphs (with no restrictions whatsoever on connectivity, planarity, etc.) and construct orthogonal grid drawings, which are widely used in software and database ...
Acknowledgements We thank Yannis Tollis, Achilleas Papakostas and the anonymous referees for useful comments and suggestions. ...
doi:10.1016/s0925-7721(96)00005-3
fatcat:gumdlfc3irccrfw4omci22r3ya
SNAP, Small-world Network Analysis and Partitioning: An open-source parallel graph framework for the exploration of large-scale networks
2008
Proceedings, International Parallel and Distributed Processing Symposium (IPDPS)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We conduct an extensive experimental study on real-world graph instances and demonstrate that our parallel schemes, coupled with aggressive algorithm engineering for smallworld networks, give significant ...
We present SNAP (Small-world Network Analysis and Partitioning), an open-source graph framework for exploratory study and partitioning of large-scale networks. ...
We thank Nicolas Bitouze (ENS Cachan) for implementing the parallel greedy agglomeration algorithm, and Jon Berry and Bruce Hendrickson (Sandia National Laboratories) for discussions on large-scale graph ...
doi:10.1109/ipdps.2008.4536261
dblp:conf/ipps/BaderM08
fatcat:gceim62ogjdybe4nfyx224t4wa
Achieving Fault-Tolerant Network Topology in Wireless Mesh Networks
[chapter]
2012
Wireless Mesh Networks - Efficient Link Scheduling, Channel Assignment and Network Planning Strategies
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Then we will discuss related work to the automatic base station planning algorithm. ...
Availability of the radio coverage The availability of the service radio coverage is a necessary condition for reliable communication in wireless networks. ...
The project flexWARE (Flexible Wireless Automation in Real-Time Environments) develops a communication system for factory-wide wireless real-time control [12, 13, 38] . ...
doi:10.5772/50173
fatcat:ees7q5gu7feethplpqnpbkkvwa
Large Deviations of Convex Hulls of Random Walks and Other Stochastic Models
2019
Zenodo
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The same interaction also leads to an increased difficulty in obtaining results analytically, such that the numerical examination of the whole distribution seems worthwhile. ...
For this rather simple model much progress was made in the last decades and it is the only problem of this thesis for which prior numerical results of the whole distribution exists in the special case ...
Large-deviation properties of the largest biconnected component for random graphs The first author, Hendrik Schawe, is the author of the thesis at hand. Alexander K. ...
doi:10.5281/zenodo.3377932
fatcat:pbej6euvmjdtjkantta66er77u
Multi-Robot Path-Planning Problem for a Heavy Traffic Control Application: A Survey
2016
International Journal of Advanced Computer Science and Applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This survey looked at the methods used to solve multi-autonomous vehicle path-planning for an application of heavy traffic control in cities. ...
The study found that decoupled centralised approaches are the most relevant approaches for an autonomous vehicle path-planning problem for three reasons: (1) a city is a large environment and coupled centralised ...
Multi-robot path planning (MPP) is an abstraction of the problem of finding the complete optimal path from the start point to the target point for each robot with the minimum time and path length while ...
doi:10.14569/ijacsa.2016.070623
fatcat:7f64mov5uvdh5hrbwlgz4qgyw4
On the Complexity of Checking Transactional Consistency
[article]
2019
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Transactions simplify concurrent programming by enabling computations on shared data that are isolated from other concurrent computations and are resilient to failures. ...
Modern databases provide different consistency models for transactions corresponding to different tradeoffs between consistency and availability. ...
We extend these results even further by relying on an abstraction of executions called communication graphs [15] . ...
arXiv:1908.04509v1
fatcat:tmr2a6whgjholfxklnucsn2hwe
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
1998
Proceedings of the thirtieth annual ACM symposium on Theory of computing - STOC '98
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Deterministic fully dynamic graph algorithms are presented for connectivity, minimum spanning tree, 2-edge connectivity, and biconnectivity. ...
n) biconnectivity. ...
We would like to thank Haim Kaplan for careful comments to an earlier draft of the document. ...
doi:10.1145/276698.276715
dblp:conf/stoc/HolmLT98
fatcat:i3sknyp5ffc6tex4rslclngshi
10 Reasons to Get Interested in Graph Drawing
[chapter]
2019
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
This is an invitation to the research area of graph drawing. ...
It encompasses basic research such as graph theory, complexity theory, data structures, and graph algorithms as well as applied research such as software libraries, implementations, and applications. ...
[22] compute an order of the connections suitable for incremental placement, leading to an O(n log n) time algorithm. ...
doi:10.1007/978-3-319-91908-9_6
fatcat:wchqxlk4fbfqdmhdjhhks74joe
Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
2001
Journal of the ACM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Deterministic fully dynamic graph algorithms are presented for connectivity, minimum spanning tree, 2-edge connectivity, and biconnectivity. ...
n) biconnectivity. ...
We would like to thank Haim Kaplan for careful comments to an earlier draft of the document. ...
doi:10.1145/502090.502095
fatcat:nytjliurxbenfeunk5tzhaakmi
Lightweight causal and atomic group multicast
1991
ACM Transactions on Computer Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
If a given group is in a biconnected component of size k, processes in this group need only to maintain and transmit timestamps for other groups in this biconnected component. ...
Our approach will be to construct an abstract description of the group overlap structure for the system. ...
ACKNOWLEDGMENTS The authors are grateful to Maureen Robinson for the preparation of many of the figures. ...
doi:10.1145/128738.128742
fatcat:touj52ue6zgqvjizvct6d2was4
Learning and Multiagent Reasoning for Autonomous Agents
2007
International Joint Conference on Artificial Intelligence
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf.
To be applicable for teams of autonomous robots, all algorithms must be fully distributed. ...
An important component of this incremental design process involves reevaluating the assumptions made about bidders in light of auction outcomes. ...
dblp:conf/ijcai/Stone07
fatcat:2br3vltrvfefffmgztnr2ha75m
Counter strike
2013
Proceedings of the VLDB Endowment
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
For both optimization strategies, efficient enumeration algorithms have been published. ...
However, there are two severe limitations for the topdown approach: The published algorithms can handle only (1) simple (binary) join predicates and (2) inner joins. ...
We thank Simone Seeger for her help preparing this manuscript and the referees for their thorough feedback. ...
doi:10.14778/2556549.2556565
fatcat:izn2bsgkszglnastqnobapfgeq
Mobile Heterogeneous Sensor Network for Prioritized Sensing
2013
Journal of Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We also provide an algorithm that allows for adding communication links to the minimal spanning tree of the heterogeneous proximity graph to create a biconnected graph that is robust to a single node failure ...
We then combine a prioritized search algorithm and the communication constraints to provide a decentralized prioritized sensing control algorithm for a heterogenous sensor network that maintains network ...
Algorithm 2 2 Biconnected Graph Algorithm (G B ) Assume a complete graph, G with n + m vertices, compute M ST G . ...
doi:10.12720/jcm.8.1.16-31
fatcat:5wkertlaefaufhlccqjxl5qkny
« Previous
Showing results 1 — 15 out of 134 results