76 research outputs found
Polynomial kernels for 3-leaf power graph modification problems
A graph G=(V,E) is a 3-leaf power iff there exists a tree T whose leaves are
V and such that (u,v) is an edge iff u and v are at distance at most 3 in T.
The 3-leaf power graph edge modification problems, i.e. edition (also known as
the closest 3-leaf power), completion and edge-deletion, are FTP when
parameterized by the size of the edge set modification. However polynomial
kernel was known for none of these three problems. For each of them, we provide
cubic kernels that can be computed in linear time for each of these problems.
We thereby answer an open problem first mentioned by Dom, Guo, Huffner and
Niedermeier (2005).Comment: Submitte
Mim-Width III. Graph powers and generalized distance domination problems
We generalize the family of (σ,ρ) problems and locally checkable vertex partition problems to their distance versions, which naturally captures well-known problems such as Distance-r Dominating Set and Distance-r Independent Set. We show that these distance problems are in XP parameterized by the structural parameter mim-width, and hence polynomial-time solvable on graph classes where mim-width is bounded and quickly computable, such as k-trapezoid graphs, Dilworth k-graphs, (circular) permutation graphs, interval graphs and their complements, convex graphs and their complements, k-polygon graphs, circular arc graphs, complements of d-degenerate graphs, and H-graphs if given an H-representation. We obtain these results by showing that taking any power of a graph never increases its mim-width by more than a factor of two. To supplement these findings, we show that many classes of (σ,ρ) problems are W[1]-hard parameterized by mimwidth + solution size. We show that powers of graphs of tree-width w − 1 or path-width w and powers of graphs of clique-width w have mim-width at most w. These results provide new classes of bounded mim-width. We prove a slight strengthening of the first statement which implies that, surprisingly, Leaf Power graphs which are of importance in the field of phylogenetic studies have mim-width at most 1.publishedVersio
Exploiting graph structures for computational efficiency
Coping with NP-hard graph problems by doing better than simply brute force is a field of significant practical importance, and which have also sparked wide theoretical interest. One route to cope with such hard graph problems is to exploit structures which can possibly be found in the input data or in the witness for a solution. In the framework of parameterized complexity, we attempt to quantify such structures by defining numbers which describe "how structured" the graph is. We then do a fine-grained classification of its computational complexity, where not only the input size, but also the structural measure in question come in to play. There is a number of structural measures called width parameters, which includes treewidth, clique-width, and mim-width. These width parameters can be compared by how many classes of graphs that have bounded width. In general there is a tradeoff; if more graph classes have bounded width, then fewer problems can be efficiently solved with the aid of a small width; and if a width is bounded for only a few graph classes, then it is easier to design algorithms which exploit the structure described by the width parameter. For each of the mentioned width parameters, there are known meta-theorems describing algorithmic results for a wide array of graph problems. Hence, showing that decompositions with bounded width can be found for a certain graph class yields algorithmic results for the given class. In the current thesis, we show that several graph classes have bounded width measures, which thus gives algorithmic consequences. Algorithms which are FPT or XP parameterized by width parameters are exploiting structure of the input graph. However, it is also possible to exploit structures that are required of a witness to the solution. We use this perspective to give a handful of polynomial-time algorithms for NP-hard problems whenever the witness belongs to certain graph classes. It is also possible to combine structures of the input graph with structures of the solution witnesses in order to obtain parameterized algorithms, when each structure individually is provably insufficient to provide so under standard complexity assumptions. We give an example of this in the final chapter of the thesis
Introductory Notes to Algebraic Statistics
These are the notes of a short course on algebraic
statistics, a new discipline across the fields of statistical modeling
and computational commutativa algebra. The basics of the
theory are provided together with brief reference to applications to
design of experiments, to exponential and graphical models, and
to computational biology
Local Certification of Some Geometric Intersection Graph Classes
In the context of distributed certification, the recognition of graph classes
has started to be intensively studied. For instance, different results related
to the recognition of planar, bounded tree-width and -minor free graphs have
been recently obtained. The goal of the present work is to design compact
certificates for the local recognition of relevant geometric intersection graph
classes, namely interval, chordal, circular arc, trapezoid and permutation.
More precisely, we give proof labeling schemes recognizing each of these
classes with logarithmic-sized certificates. We also provide tight logarithmic
lower bounds on the size of the certificates on the proof labeling schemes for
the recognition of any of the aforementioned geometric intersection graph
classes
Graph Algorithms and Applications
The mixture of data in real-life exhibits structure or connection property in nature. Typical data include biological data, communication network data, image data, etc. Graphs provide a natural way to represent and analyze these types of data and their relationships. Unfortunately, the related algorithms usually suffer from high computational complexity, since some of these problems are NP-hard. Therefore, in recent years, many graph models and optimization algorithms have been proposed to achieve a better balance between efficacy and efficiency. This book contains some papers reporting recent achievements regarding graph models, algorithms, and applications to problems in the real world, with some focus on optimization and computational complexity
- …