Sep 11, 2015 · Recall that the minimum vulnerability problem is NP-hard even for outerplanar graphs and for 2-trees (Corollary 1), which are of treewidth at ...

In this paper, we study the problem from the viewpoint of specific graph classes, and give three results. We first show that the problem is NP-hard even for ...

In this paper, we study the problem from the viewpoint of specific graph classes, and give three results. We first show that the problem remains NP-hard even.

We revisit the problem of finding k paths with a minimum number of shared edges between two vertices of a graph.

The problem of finding paths with a minimum number of shared edges between two vertices of a graph is revisited and it is shown that the problem is ...

Nov 1, 2016 · This problem generalizes the disjoint path problem, the minimum shared edges problem and the minimum edge cost flow problem for undirected ...

In this paper, we study the problem from the viewpoint of specific graph classes, and give three results. We first show that the problem remains NP-hard even ...

In this paper, we study the problem from the viewpoint of specific graph classes, and give three results. We first show that the problem remains NP-hard ...

Fingerprint. Dive into the research topics of 'The minimum vulnerability problem on specific graph classes'. Together they form a unique fingerprint.

In this paper, we study the problem from the viewpoint of specific graph classes, and give three results. We first show that the problem remains NP-hard even ...