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

Given a directed graph and a source vertex, the fully dynamic single-source reachability problem is to maintain the set of vertices that are reachable from the given vertex, subject to edge deletions and insertions. It is one of the most…

Black holes are usually studied without including effects of the expanding universe. However in some recent studies black holes have been embedded in an expanding universe, in order to determine the interplay, if any, of these two dynamical…

Dynamic complexity is concerned with updating the output of a problem when the input is slightly changed. We study the dynamic complexity of Dyck reachability problems in directed and undirected graphs, where updates may add or delete…

A mobile ad hoc network (MANET) is a collection of autonomous nodes that communicate with each other by forming a multi-hop radio network and maintaining connections in a decentralized manner. Security remains a major challenge for these…

In this work we study a well-known and challenging problem of Multi-agent Pathfinding, when a set of agents is confined to a graph, each agent is assigned a unique start and goal vertices and the task is to find a set of collision-free…

We describe some necessary conditions for the existence of a Hamiltonian path in any graph (in other words, for a graph to be traceable). These conditions result in a linear time algorithm to decide the Hamiltonian path problem for cactus…

We examine the problem of gathering $k \geq 2$ agents (or multi-agent rendezvous) in dynamic graphs which may change in every synchronous round but remain always connected ($1$-interval connectivity) [KLO10]. The agents are identical and…

We consider the problem where an agent wants to find a hidden object that is randomly located in some vertex of a directed acyclic graph (DAG) according to a fixed but possibly unknown distribution. The agent can only examine vertices whose…

We study the fundamental problem of graph exploration in dynamic graphs using mobile agents. We consider $1$-interval connected dynamic graphs, where the topology may change arbitrarily from round to round as long as the graph remains…

Bringing gravity into a quantum-mechanical framework is likely the most profound remaining problem in fundamental physics. The "unitarity crisis" for black hole evolution appears to be a key facet of this problem, whose resolution will…

Consider a group of autonomous mobile computational entities, called agents, arbitrarily placed at some nodes of a dynamic but always connected ring. The agents neither have any knowledge about the size of the ring nor have a common notion…

We study the problem of patrolling the nodes of a network collaboratively by a team of mobile agents, such that each node of the network is visited by at least one agent once in every $I(n)$ time units, with the objective of minimizing the…

A Mobile Ad-Hoc Network is a collection of mobile nodes that are dynamically and arbitrarily located in such a manner that the interconnections between nodes are capable of changing on continual basis. Due to security vulnerabilities of the…

Under the assumption that a dynamical scalar field is responsible for the current acceleration of the Universe, we explore the possibility of probing its physics in black hole merger processes with gravitational wave interferometers.…

A dynamic graph algorithm is a data structure that supports edge insertions, deletions, and specific problem queries. While extensive research exists on dynamic algorithms for graph problems solvable in polynomial time, most of these…

A network can be analyzed by means of many graph theoretical parameters. In the context of networks analysis, closeness is a structural metric that evaluates a node's significance inside a network. A cactus is a connected graph in which any…

Cosmic black holes can act as agents of particle acceleration. We study properties of a system consisting of a rotating black hole immersed in a large-scale organized magnetic field. Electrically charged particles in the immediate…

We analyze the causal structure of McVittie spacetime for a classical bouncing cosmological model. In particular, we compute the trapping horizons of the metric and integrate the trajectories of radial null geodesics before, during, and…

Since black holes can be formed through widely varying processes, the horizon structure is highly complicated in the dynamical phase. Nonetheless, as numerical simulations show, the final state appears to be universal, well described by the…

Security in Mobile Ad hoc Network (MANET) is one of the key challenges due to its special features e.g. hop-by-hop communications, dynamic topology, and open network boundary that received tremendous attention by scholars. Traditional…