Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- short-paperNovember 2018
Using biconnected components for efficient identification of upstream features in large spatial networks (GIS cup)
SIGSPATIAL '18: Proceedings of the 26th ACM SIGSPATIAL International Conference on Advances in Geographic Information SystemsNovember 2018, Pages 630–633https://doi.org/10.1145/3274895.3276476This paper presents a solution to the problem posed in the ACM SIGSPATIAL GIS Cup 2018, namely to identify all upstream features---nodes and edges existing on simple paths between starting points and controllers---in a given spatial network. Our ...
- articleAugust 2003
On the minimum local-vertex-connectivity augmentation in graphs
Discrete Applied Mathematics (DAMA), Volume 129, Issue 2-301 August 2003, Pages 475–486https://doi.org/10.1016/S0166-218X(02)00580-2Given a graph G and target values r(u,v) prescribed for each pair of vertices u and v, we consider the problem of augmenting G by a smallest set F of new edges such that the resulting graph G+F has at least r(u,v) internally disjoint paths between each ...