COMPOSING DYNAMIC PROGRAMMING TREE-DECOMPOSITION-BASED ALGORITHMS

Composing dynamic programming tree-decomposition-based algorithms

Given two integers $ell$ and $p$ as well as $ell$ graph classes $mathcal{H}_1,ldots,mathcal{H}_ell$, the problems $mathsf{GraphPart}(mathcal{H}_1, ldots, mathcal{H}_ell,p)$, reak 6love luzern $mathsf{VertPart}(mathcal{H}_1, ldots, mathcal{H}_ell)$, and $mathsf{EdgePart}(mathcal{H}_1, ldots, mathcal{H}_ell)$ ask, given graph $G$ as input, whether $

read more


Topological and hydraulic metrics-based search space reduction for optimal re-sizing of water distribution networks

Pipe re-sizing of water distribution networks (WDNs) aims at improving the service performance to the required level, while minimizing the cost of replacing pipes in the network.The main challenge comes from the identification of the most effective pipes to re-size from a large number of interacting components.Performing a global search over all pi

read more

Driving Interconnected Networks to Supercriticality

Networks in the real world do not exist as isolated entities, but they are often part of more complicated structures composed of many interconnected network layers.Recent studies have shown that such mutual dependence makes real networked systems potentially exposed to atypical structural and dynamical behaviors, kinkalicious and thus there is an u

read more

Interreligious dialogue as a myth

The authors aim in this article to show why it is extremely difficult to expect representatives of missionary religions to engage in productive interreligious dialogue.The article demonstrates how the imperative to convert, which is rooted in a sense of epistemic authority that one holds the best version of truth, precludes interreligious dialogue

read more