6 research outputs found
On F-independence in graphs
Let F be a set of graphs and for a graph G let F(G) and F (G)
denote the maximum order of an induced subgraph of G which does not contain
a graph in F as a subgraph and which does not contain a graph in F as an
induced subgraph, respectively. Lower bounds on F (G) and F (G) and
algorithms realizing them are presented
Kernelization and Parameterized Algorithms for 3-Path Vertex Cover
A 3-path vertex cover in a graph is a vertex subset such that every path
of three vertices contains at least one vertex from . The parameterized
3-path vertex cover problem asks whether a graph has a 3-path vertex cover of
size at most . In this paper, we give a kernel of vertices and an
-time and polynomial-space algorithm for this problem, both new
results improve previous known bounds.Comment: in TAMC 2016, LNCS 9796, 201
New approach to the k-independence number of a graph
Let G = (V,E) be a graph and k > 0 an integer. A k-independent set S V is a set of vertices such that the maximum degree in the graph induced by S is at most k. With k(G) we denote the maximum cardinality of a k-independent set of G. We prove that, for a graph G on n vertices and average degree d, k(G) > k+1 dde+k+1n, improving the hitherto best general lower bound due to Caro and Tuza [Improved lower bounds on k-independence, J. Graph Theory 15 (1991), 99–107].Peer ReviewedPostprint (published version
Minimum k-path vertex cover
International audienceA subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by P_k(G) the minimum cardinality of a k-path vertex cover in G. It is shown that the problem of determining P_k(G) is NP-hard for each k ≥ 2, while for trees the problem can be solved in linear time. We investigate upper bounds on the value of P_k(G) and provide several estimations and exact values of P_k(G). We also prove that P_3(G) ≤ (2n + m)/6, for every graph G with n vertices and m edges
Algorithms for the Maximum Independent Set Problem
This thesis focuses mainly on the Maximum Independent Set (MIS) problem. Some related graph theoretical combinatorial problems are also considered. As these problems are generally NP-hard, we study their complexity in hereditary graph classes, i.e. graph classes defined by a set F of forbidden induced subgraphs.
We revise the literature about the issue, for example complexity results, applications, and techniques tackling the problem. Through considering some general approach, we exhibit several cases where the problem admits a polynomial-time solution. More specifically, we present polynomial-time algorithms for the MIS problem in:
+ some subclasses of -free graphs (thus generalizing the classical result for -free graphs);
+ some subclasses of -free graphs (thus generalizing the classical results for subclasses of P5-free graphs);
+ some subclasses of -free graphs and -free graphs; and various subclasses of graphs of bounded maximum degree, for example subcubic graphs.
Our algorithms are based on various approaches. In particular, we characterize augmenting graphs in a subclass of -free graphs and a subclass of -free graphs. These characterizations are partly based on extensions of the concept of redundant set [125]. We also propose methods finding augmenting chains, an extension of the method in [99], and finding augmenting trees, an extension of the methods in [125]. We apply the augmenting vertex technique, originally used for -free graphs or banner-free graphs, for some more general graph classes.
We consider a general graph theoretical combinatorial problem, the so-called Maximum -Set problem. Two special cases of this problem, the so-called Maximum F-(Strongly) Independent Subgraph and Maximum F-Induced Subgraph, where F is a connected graph set, are considered. The complexity of the Maximum F-(Strongly) Independent Subgraph problem is revised and the NP-hardness of the Maximum F-Induced Subgraph problem is proved. We also extend the augmenting approach to apply it for the general Maximum Π -Set problem.
We revise on classical graph transformations and give two unified views based on pseudo-boolean functions and αff-redundant vertex. We also make extensive uses of α-redundant vertices, originally mainly used for -free graphs, to give polynomial solutions for some subclasses of -free graphs and -free graphs.
We consider some classical sequential greedy heuristic methods. We also combine classical algorithms with αff-redundant vertices to have new strategies of choosing the next vertex in greedy methods. Some aspects of the algorithms, for example forbidden induced subgraph sets and worst case results, are also considered.
Finally, we restrict our attention on graphs of bounded maximum degree and subcubic graphs. Then by using some techniques, for example ff-redundant vertex, clique separator, and arguments based on distance, we general these results for some subclasses of -free subcubic graphs