1,015 research outputs found

    Exact Distance Oracles for Planar Graphs with Failing Vertices

    Full text link
    We consider exact distance oracles for directed weighted planar graphs in the presence of failing vertices. Given a source vertex uu, a target vertex vv and a set XX of kk failed vertices, such an oracle returns the length of a shortest uu-to-vv path that avoids all vertices in XX. We propose oracles that can handle any number kk of failures. More specifically, for a directed weighted planar graph with nn vertices, any constant kk, and for any q∈[1,n]q \in [1,\sqrt n], we propose an oracle of size O~(nk+3/2q2k+1)\tilde{\mathcal{O}}(\frac{n^{k+3/2}}{q^{2k+1}}) that answers queries in O~(q)\tilde{\mathcal{O}}(q) time. In particular, we show an O~(n)\tilde{\mathcal{O}}(n)-size, O~(n)\tilde{\mathcal{O}}(\sqrt{n})-query-time oracle for any constant kk. This matches, up to polylogarithmic factors, the fastest failure-free distance oracles with nearly linear space. For single vertex failures (k=1k=1), our O~(n5/2q3)\tilde{\mathcal{O}}(\frac{n^{5/2}}{q^3})-size, O~(q)\tilde{\mathcal{O}}(q)-query-time oracle improves over the previously best known tradeoff of Baswana et al. [SODA 2012] by polynomial factors for q=Ω(nt)q = \Omega(n^t), t∈(1/4,1/2]t \in (1/4,1/2]. For multiple failures, no planarity exploiting results were previously known

    Repetition Detection in a Dynamic String

    Get PDF
    A string UU for a non-empty string U is called a square. Squares have been well-studied both from a combinatorial and an algorithmic perspective. In this paper, we are the first to consider the problem of maintaining a representation of the squares in a dynamic string S of length at most n. We present an algorithm that updates this representation in n^o(1) time. This representation allows us to report a longest square-substring of S in O(1) time and all square-substrings of S in O(output) time. We achieve this by introducing a novel tool - maintaining prefix-suffix matches of two dynamic strings. We extend the above result to address the problem of maintaining a representation of all runs (maximal repetitions) of the string. Runs are known to capture the periodic structure of a string, and, as an application, we show that our representation of runs allows us to efficiently answer periodicity queries for substrings of a dynamic string. These queries have proven useful in static pattern matching problems and our techniques have the potential of offering solutions to these problems in a dynamic text setting

    Mapping the urban green area influence local climate under windless and light wind conditions : the case of western part of Athens, Greece

    Get PDF
    Investigations concentrated on the influence of the urban green areas on the local climate. Nocturnal mobile measurements were carried out under windless and light wind conditions, over the thermally polluted western part of Athens, Greece. For this purpose three green areas with different size and characteristics were selected. The collected data were analysed using geographical information system software. The spatial patterns of air temperature and the calculation of Discomfort Index indicated a beneficial influence of green areas and non built-up areas

    Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs

    Get PDF

    Climate Change: a Multiplier for Terrorist Activity

    Get PDF
    Over the past ten years, both understanding and awareness of the links between climate change and security have increased. However, those links are not simple and clear. The growing impacts of climate change do not automatically lead to more violence and conflict. Rather, climate change acts as a threat multiplier. The study addresses the question of how the impacts of climate change are a contributing factor in the rise and growth of terrorism and political violence in African regions. To explain the complexity of the problem, a system dynamics model structure is presented in the form of casual loop diagrams. The dynamic behavior in livelihood arises from negative impacts of climate change on livelihoods in many countries and regions through, e.g. water and land scarcity, food insecurity and migration. The affected population groups are becoming more vulnerable not only to negative climate developments but also to recruitments by violent groups such as Al-Qaeda, Islamic State, Al-Shabaab or other militia. These terrorist groups can offer alternative livelihoods, economic motivations, and responses to possible political and economic dissatisfactions. This does not imply that there is a direct link between climate change and terrorists-related violence and conflict. However, environmental impacts and climatic change contributes to creating conditions in which these groups can thrive and facilitate the pursuit of their strategies. Further, violent groups are using natural resources as a weapon of war. In fragile environments, these groups can use water resources as a weapon or reduce access to natural resources. This development creates a dynamic for these groups, considering the fact that the scarcer resources become, the more power is given to those who controls them. Climate change will increasingly challenge the states’ abilities to provide services and stability. In particular, extreme climate events can threaten the relationship between governments and populations. In such a case, a poor and slow government response could contribute to further instability, fragility, violence and strengthening of violent groups
    • …
    corecore