1 PROBLEM DEFINITION The theory of bidimensionality provides general techniques for designing efficient fixed-parameter algorithms and approximation algorithms for a broad range of NP-hard graph problems in a broad range of graphs. This theory applies to graph problems that are " bidi-mensional " in the sense that (1) the solution value for the k ×k grid graph and similar graphs grows with k, t...

and Local Rule Learning in Attributed Networks Henry Soldano(B), Guillaume Santini, and Dominique Bouthinon 1 Université Paris 13, Sorbonne Paris Cité, L.I.P.N UMR-CNRS 7030 F-93430, Villetaneuse, France 2 Atelier de BioInformatique, ISYEB UMR 7205 CNRS MNHN UPMC EPHE, Museum d’Histoire Naturelle, F-75005, Paris, France Abstract. We address the problem of finding local patterns and related loca...

A graph H is a square root of a graph G if G can be obtained from H by the addition of edges between any two vertices in H that are of distance 2 of each other. The Square Root problem is that of deciding whether a given graph admits a square root. This problem is only known to be NP-complete for chordal graphs and polynomial-time solvable for non-trivial minor-closed graph classes and a very l...

A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scaling. While Kuramochi and Karypis (ICDM2002) extensively studied the frequent pattern mining problem for geometric subgraphs, the maximal graph mining has not been considered so far. In this paper, we study the maximal...

A geometric graph is a labeled graph whose vertices are points in the 2D plane with isomorphism invariant under geometric transformations such as translation, rotation, and scaling. While Kuramochi and Karypis (ICDM2002) extensively studied the frequent pattern mining problem for geometric subgraphs, the maximal graph mining has not been considered so far. In this paper, we study the maximal (o...

A graph G is said to be F-residual if for every point u in G, the graph obtained by removing the closed neighborhood of u from G is isomorphic to F. Similarly, if the remove of m consecutive closed neighborhoods yields Kn, then G is called m-Kn-residual graph. Erdös determine the minimum order of the m-Kn-residual graph for all m and n, the minimum order of the connected Kn-residual graph is fo...

For several graph theoretic parameters such as vertex cover and dominating set, it is known that if their values are bounded by k then the treewidth of the graph is bounded by some function of k. This fact is used as the main tool for the design of several fixed-parameter algorithms on minor-closed graph classes such as planar graphs, single-crossing-minor-free graphs, and graphs of bounded gen...

A graph G is called a 1-planar graph if it can be drawn on the plane so that each edge includes at most one crossing. It is not so difficult to see that |E(G)| ≤ 4|V (G)| − 8 for any 1-planar graph. In particular, a 1-planar graph G is said to be optimal if the equality holds. Suzuki has already proved that there exists an optimal 1-planar graph which can be embedded on the orientable closed su...