It is proved that there exist DAGs for which any shortest-paths preserving integer reweighting requires weights of size $2^{\Omega(n)}$, even when the DAG has very simple structure.
This paper develops an exact algorithm based on the Branch and Bound approach for solving PIDS on chordal graphs, which involves identifying the smallest group of vertices in a given network that maximizes influence throughout the network.
This paper generalises the existing PTAS for complete graphs from a fixed to an arbitrary number of intervals and disprove an existing conjecture, which states that every instance of BIA admits a solution satisfying at least three quarters of all edges.
We study the classical and parameterized complexity of efficient connected allocation problems on graphs, where efficiency is measured by egalitarian and utilitarian welfare maximization. We first establish a sharp complexity dichotomy in the classical setting: both problems are NP-hard in general and remain hard even...
It is proved that Minimal-to-Maximal Conversion Search is in fact not output-polynomial and the lower bound construction motivates a more detailed analysis of how certain heuristic choices in the algorithm design affect the running time.
The degree/diameter problem asks for the largest order of a graph with a given diameter and maximum vertex degree. This has been widely studied and given rise to a recent variation for mixed graphs (graphs with both undirected edges and directed arcs), where an additional bound is placed on the maximum directed out-deg...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
