Related papers: Black Hole Search in Dynamic Graphs
Maximum cardinality matching in bipartite graphs is an important and well-studied problem. The fully dynamic version, in which edges are inserted and deleted over time has also been the subject of much attention. Existing algorithms for…
Dynamic optimization problems have gained significant attention in evolutionary computation as evolutionary algorithms (EAs) can easily adapt to changing environments. We show that EAs can solve the graph coloring problem for bipartite…
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…
In this paper, we study collision-free graph exploration in an anonymous pot labeled network. Two identical mobile agents, starting from different nodes in $G$ have to explore the nodes of $G$ in such a way that for every node $v$ in $G$,…
In this paper we study the problem of dynamically maintaining graph properties under batches of edge insertions and deletions in the massively parallel model of computation. In this setting, the graph is stored on a number of machines, each…
In this paper, we consider the partial gathering problem of mobile agents in asynchronous unidirectional rings equipped with whiteboards on nodes. The partial gathering problem is a new generalization of the total gathering problem. The…
This paper presents a comprehensive theoretical study of a Schwarzschild-like Anti-de Sitter (AdS) black hole (BH) influenced by a new cloud of strings (NCS) and a dark matter halo (DMH) characterized by a Dehnen-type density profile. We…
The rapid emergence of supermassive black holes (SMBHs) in the early Universe poses a challenge to current models of black hole growth. One promising formation pathway is the direct collapse black hole (DCBH) scenario, in which gas in…
Cut problems form one of the most fundamental classes of problems in algorithmic graph theory. For instance, the minimum cut, the minimum $s$-$t$ cut, the minimum multiway cut, and the minimum $k$-way cut are some of the commonly…
The Balanced Connected Subgraph problem (BCS) was recently introduced by Bhore et al. (CALDAM 2019). In this problem, we are given a graph $G$ whose vertices are colored by red or blue. The goal is to find a maximum connected subgraph of…
We study the Balanced Connected Subgraph(shortly, BCS) problem on geometric intersection graphs such as interval, circular-arc, permutation, unit-disk, outer-string graphs, etc. Given a vertex-colored graph $G=(V,E)$, where each vertex in…
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…
In this paper we study the dynamic versions of two basic graph problems: Minimum Dominating Set and its variant Minimum Connected Dominating Set. For those two problems, we present algorithms that maintain a solution under edge insertions…
Dynamical solutions for an evolving multiple network of black holes near a cosmological bounce dominated by a scalar field are investigated. In particular, we consider the class of black hole lattice models in a hyperspherical cosmology,…
Dense subgraph discovery is a fundamental problem in graph mining with a wide range of applications \cite{gionis2015dense}. Despite a large number of applications ranging from computational neuroscience to social network analysis, that take…
Inspired by possibility that the Schwarzschild black hole may not be the unique spherically symmetric vacuum solution to generalisations of general relativity, we consider black holes in pure fourth order higher derivative gravity treated…
Searching for violations of the no-hair theorem (NHT) is a powerful way to test gravity, and more generally fundamental physics, particularly with regards to the existence of additional scalar fields. The first observation of a black hole…
We consider the problem of characterizing graphs with the maximum spectral radius among the connected graphs with given numbers of vertices and edges. It is well-known that the candidates for extremal graphs are threshold graphs, but only a…
Connectivity is a central notion of graph theory and plays an important role in graph algorithm design and applications. With emerging new applications in networks, a new type of graph connectivity problem has been getting more…
We investigate a graph probing problem in which an agent has only an incomplete view $G' \subsetneq G$ of the network and wishes to explore the network with least effort. In each step, the agent selects a node $u$ in $G'$ to probe. After…