4 research outputs found
Resolving Prime Modules: The Structure of Pseudo-cographs and Galled-Tree Explainable Graphs
The modular decomposition of a graph is a natural construction to capture
key features of in terms of a labeled tree whose vertices are
labeled as "series" (), "parallel" () or "prime". However, full
information of is provided by its modular decomposition tree only,
if is a cograph, i.e., does not contain prime modules. In this case,
explains , i.e., if and only if the lowest common
ancestor of and has label "". Pseudo-cographs,
or, more general, GaTEx graphs are graphs that can be explained by labeled
galled-trees, i.e., labeled networks that are obtained from the modular
decomposition tree of by replacing the prime vertices in by
simple labeled cycles. GaTEx graphs can be recognized and labeled galled-trees
that explain these graphs can be constructed in linear time.
In this contribution, we provide a novel characterization of GaTEx graphs in
terms of a set of 25 forbidden induced subgraphs.
This characterization, in turn, allows us to show that GaTEx graphs are closely
related to many other well-known graph classes such as -sparse and
-reducible graphs, weakly-chordal graphs, perfect graphs with perfect
order, comparability and permutation graphs, murky graphs as well as interval
graphs, Meyniel graphs or very strongly-perfect and brittle graphs. Moreover,
we show that every GaTEx graph as twin-width at most 1.Comment: 18 pages, 3 figure
Comparing graphs
Graphs are a well-studied mathematical concept, which has become ubiquitous to represent structured data in many application domains like computer vision, social network analysis or chem- and bioinformatics. The ever-increasing amount of data in these domains requires to efficiently organize and extract information from large graph data sets. In this context techniques for comparing graphs are fundamental, e.g., in order to obtain meaningful similarity measures between graphs. These are a prerequisite for the application of a variety of data mining algorithms to the domain of graphs. Hence, various approaches to graph comparison evolved and are wide-spread in practice. This thesis is dedicated to two different strategies for comparing graphs: maximum common subgraph problems and graph kernels.
We study maximum common subgraph problems, which are based on classical graph-theoretical concepts for graph comparison and are NP-hard in the general case. We consider variants of the maximum common subgraph problem in restricted graph classes, which are highly relevant for applications in cheminformatics. We develop a polynomial-time algorithm, which allows to compute a maximum common subgraph under block and bridge preserving isomorphism in series-parallel graphs. This generalizes the problem of computing maximum common biconnected subgraphs in series-parallel graphs. We show that previous approaches to this problem, which are based on the separators represented by standard graph decompositions, fail. We introduce the concept of potential separators to overcome this issue and use them algorithmically to solve the problem in series-parallel graphs. We present algorithms with improved bounds on running time for the subclass of outerplanar graphs. Finally, we establish a sufficient condition for maximum common subgraph variants to allow derivation of graph distance metrics. This leads to polynomial-time computable graph distance metrics in restricted graph classes. This progress constitutes a step towards solving practically relevant maximum common subgraph problems in polynomial time.
The second contribution of this thesis is to graph kernels, which have their origin in specific data mining algorithms. A key property of graph kernels is that they allow to consider a large (possibly infinite) number of features and can support graphs with arbitrary annotation, while being efficiently computable. The main contributions of this part of the thesis are (i) the development of novel graph kernels, which are especially designed for attributed graphs with arbitrary annotations and (ii) the systematic study of implicit and explicit mapping into a feature space for computation of graph kernels w.r.t. its impact on the running time and the ability to consider arbitrary annotations. We propose graph kernels based on bijections between subgraphs and walks of fixed length. In an experimental study we show that these approaches provide a viable alternative to known techniques, in particular for graphs with complex annotations