相关论文: Black Hole Search in Dynamic Cactus Graph

Recently there has been progress to resolve the issue regarding the non-existence of the Cauchy horizon inside the static, charged, and spherically symmetric black holes. However, when we generically extend the black holes' spacetime, they…

We find black hole solutions to Euclidean 2+1 gravity coupled to a relativistic particle which have a dynamical conical singularity at the horizon. These solutions mimic the tree level contribution to the partition function of gravity…

Given a query graph that represents a pattern of interest, the emerging pattern detection problem can be viewed as a continuous query problem on a dynamic graph. We present an incremental algorithm for continuous query processing on dynamic…

The dynamics of black hole seeds in high redshift galaxies is key to understand their ability to grow via accretion and to pair in close binaries during galactic mergers. To properly follow the dynamics of black holes we develop a…

We consider the task of rendezvous in networks modeled as undirected graphs. Two mobile agents with different labels, starting at different nodes of an anonymous graph, have to meet. This task has been considered in the literature under two…

We study a graph search problem in which a team of searchers attempts to find a mobile target located in a graph. Assuming that (a) the visibility field of the searchers is limited, (b) the searchers have unit speed and (c) the target has…

Dynamic space-times, especially those manifesting horizons, provide useful laboratories for examining how macroscopic quantum behaviors consistently co-generate gravitational phenomena. For this reason, the behaviors and large-scale causal…

A team consisting of an unknown number of mobile agents, starting from different nodes of an unknown network, have to meet at the same node and terminate. This problem is known as {\em gathering}. We study deterministic gathering algorithms…

Graph Exploration problems ask a searcher to explore an unknown environment. The environment is modeled as a graph, where the searcher needs to visit each vertex beginning at some vertex. Treasure Hunt problems are a variation of Graph…

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 deletions. The problem has been…

Since a black hole does not emit light from its interior, nor does it have a surface on which light from nearby sources can be reflected, observational study of black hole physics requires observing the gravitational impact of the black…

Massive black holes are ubiquitous, occurring at the centres of all massive galaxies and possibly many low mass ones. They are no ornament which just happens to be there, but play a role vital to the growth and structure of the host galaxy.…

In this paper we study the problem of cooperative searching and tracking (SAT) of multiple moving targets with a group of autonomous mobile agents that exhibit limited sensing capabilities. We assume that the actual number of targets is not…

These are some speculations on how Grothendieck's point of view and the idea of complexity dynamics can come together in the problem of explaining the black hole information paradox. They are neither complete, nor final, but can seem like a…

A vertex or edge in a graph is critical if its deletion reduces the chromatic number of the graph by 1. We consider the problems of deciding whether a graph has a critical vertex or edge, respectively. We give a complexity dichotomy for…

We consider a class of Einstein-Maxwell-dilaton theories in general dimensions and construct both static and dynamic charged black holes. We adopt the reverse engineering procedure and make a specific ansatz for the scalar field and then…

A cactus graph is a graph in which any two cycles are edge-disjoint. We present a constructive proof of the fact that any plane graph $G$ contains a cactus subgraph $C$ where $C$ contains at least a $\frac{1}{6}$ fraction of the triangular…

We study the Cooperative Guarding problem for polygons with holes in a mobile multi-agents setting. Given a set of agents, initially deployed at a point in a polygon with $n$ vertices and $h$ holes, we require the agents to collaboratively…

Consider a small group of mobile agents whose goal is to locate a certain cell in a two-dimensional infinite grid. The agents operate in an asynchronous environment, where in each discrete time step, an arbitrary subset of the agents…

Connectivity query processing is a fundamental problem in graph processing. Given an undirected graph and two query vertices, the problem aims to identify whether they are connected via a path. Given frequent edge updates in real graph…