Related papers: Black Hole Search in Dynamic Graphs
Breadth-first search (BFS) is known as a basic search strategy for learning graph properties. As the scales of graph databases have increased tremendously in recent years, large-scale graphs G are often disk-resident. Obtaining the BFS…
Recently, researchers have extended the concept of matchings to the more general problem of finding $b$-matchings in hypergraphs broadening the scope of potential applications and challenges. The concept of $b$-matchings, where $b$ is a…
We review the motivation and search for supermassive black holes (BHs) in galaxies. Energetic nuclear activity provides indirect but compelling evidence for BH engines. Ground-based dynamical searches for central dark objects are reviewed…
The present paper studies local distributed graph problems in highly dynamic networks. Communication and changes of the graph happen in synchronous rounds and our algorithms always, i.e., in every round, satisfy non-trivial guarantees, no…
Graph Neural Networks (GNNs) have achieved promising results in tasks such as node classification and graph classification. However, recent studies reveal that GNNs are vulnerable to backdoor attacks, posing a significant threat to their…
We consider the Stochastic Matching problem, which is motivated by applications in kidney exchange and online dating. In this problem, we are given an undirected graph. Each edge is assigned a known, independent probability of existence and…
This resource letter is designed to guide students, educators, and researchers through (some of) the literature on black holes. Both the physics and astrophysics of black holes are discussed. Breadth has been emphasized over depth, and…
Graph colouring is a fundamental problem for networks, serving as a tool for avoiding conflicts via symmetry breaking, for example, avoiding multiple computer processes simultaneously updating the same resource. This paper considers a…
This paper studies the fundamental problem of graph coloring in fully dynamic graphs. Since the problem of computing an optimal coloring, or even approximating it to within $n^{1-\epsilon}$ for any $\epsilon > 0$, is NP-hard in static…
Depth first search (DFS) tree is a fundamental data structure for solving various problems in graphs. It is well known that it takes $O(m+n)$ time to build a DFS tree for a given undirected graph $G=(V,E)$ on $n$ vertices and $m$ edges. We…
Graph burning is a discrete-time process that models the propagation of information in a network. Initially, we have an undirected graph of unburned vertices. At each time step, an unburned vertex is chosen to burn; additionally, unburned…
We study dynamic graph algorithms in the Massively Parallel Computation model, which was inspired by practical data processing systems. Our goal is to provide algorithms that can efficiently handle large batches of edge insertions and…
A (fully) dynamic graph algorithm is a data structure that supports edge insertions, edge deletions, and answers specific queries pertinent to the problem at hand. In this work, we address the fully dynamic edge orientation problem, also…
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…
A hypergraph is a set V of vertices and a set of non-empty subsets of V, called hyperedges. Unlike graphs, hypergraphs can capture higher-order interactions in social and communication networks that go beyond a simple union of pairwise…
Graphs are widespread data structures used to model a wide variety of problems. The sheer amount of data to be processed has prompted the creation of a myriad of systems that help us cope with massive scale graphs. The pressure to deliver…
Let $H$ be an undirected graph. In the List $H$-Homomorphism Problem, given an undirected graph $G$ with a list constraint $L(v) \subseteq V(H)$ for each variable $v \in V(G)$, the objective is to find a list $H$-homomorphism $f:V(G) \to…
Distinguishing active galaxies from star-forming galaxies is essential for understanding galaxy evolution. Diagnostic methods like the BPT (Baldwin, Phillips, and Terlevich) diagram use optical emission-line ratios to separate galaxies.…
Wireless sensor networks are vulnerable to several attacks, one of them being the black hole attack. A black hole is a malicious node that attracts all the traffic in the network by advertising that it has the shortest path in the network.…
In this work we investigate the presence of integrable hidden structures in the dynamics of perturbed non-rotating black holes (BHs). This can also be considered as a first step in a wider program of an effective identification of ``slow''…