The Maximum Independent Set Problem is known to be NP-hard in general. In the last decades lots of effort were spent to find polynomial-time algorithms for Pt -free graphs. A recent result presentsâ€¦ (More)

A set S of vertices in a graph G is a 2-dominating set if every vertex of G not in S is adjacent to at least two vertices in S, and S is a 2-independent set if every vertex in S is adjacent to atâ€¦ (More)

The vertex cover problem and the vertex partition problem are central problems in graph theory and many generalizations are known. Two examples are the minimum k-path vertex cover problem (MkPVCP forâ€¦ (More)

The Maximum Independent Set problem is NP-hard and remains NP-hard for graphs with maximum degree three (also called subcubic graphs). In our talk we will study its complexity in hereditaryâ€¦ (More)

The maximum independent set problem is an NP-hard problem. In this paper, we consider Algorithm MAX, which is a polynomial time algorithm for finding a maximal independent set in a graph G. Weâ€¦ (More)