Graph databases are becoming increasingly popular for modeling different kinds of networks data analysis. They built over the property graph model, where nodes and edges annotated with property-value pairs. Most existing work in field is based on graphs were temporal dimension not considered. However, time present most real-world problems. Many changes may occur a as world it represents evolves...

In this paper, we consider the topological interference management (TIM) problem in a dynamic setting, where an adversary perturbs network topology to prevent exploitation of sophisticated coding opportunities (e.g., alignment). Focusing on special class – chordal networks investigate algorithmic aspects TIM under adversarial perturbation. particular, given perturbation with respect edge insert...

The adjugate matrix of $G$, denoted by $\operatorname{adj}(G)$, is the $x\mathbf{I}-\mathbf{A}$, where $\mathbf{A}$ adjacency $G$. polynomial reconstruction problem (PRP) asks if characteristic a graph $G$ can always be recovered from multiset $\operatorname{\mathcal{PD}}(G)$ containing $n$ polynomials vertex-deleted subgraphs Noting that diagonal entries $\operatorname{adj}(G)$ are precisely e...

Given a weighted undirected graph G=(V,E), the Held–Karp lower bound for Traveling Salesman Problem (TSP) is obtained by selecting an arbitrary vertex p ¯∈V, computing minimum cost tree spanning V∖{p ¯} and adding two edges adjacent to ¯. In general, different selections of ¯ provide bounds. this paper it shown that selection can be optimized, obtain largest possible bound, with same worst-case...