Abstract. Given an undirected graph G and an integer k ≥ 0, the NPhard 2-Layer Planarization problem asks whether G can be transformed into a forest of caterpillar trees by remov...
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
A homogeneous set is a non-trivial module of a graph, i.e. a nonempty, non-unitary, proper vertex subset such that all its elements present the same outer neighborhood. Given two ...
Claudson F. Bornstein, Celina M. Herrera de Figuei...
We develop a simple and practical exact algorithm for the problem of locating p facilities and assigning clients7 to them within capacity restrictions in order to minimize the max...
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...