• Corpus ID: 237371963

Induced universal graphs for families of small graphs

  title={Induced universal graphs for families of small graphs},
  author={James Trimble},
We present exact and heuristic algorithms that find, for a given family of graphs, a graph that contains each member of the family as an induced subgraph. For 0 ≤ k ≤ 6, we give the minimum number of vertices f(k) in a graph containing all k-vertex graphs as induced subgraphs, and show that 16 ≤ f(7) ≤ 18. For 0 ≤ k ≤ 5, we also give the counts of such graphs, as generated by brute-force computer search. We give additional results for small graphs containing all trees on k vertices. 


On the Minimum Common Supergraph of Two Graphs
It is shown that minimum common supergraph computation can be solved by means of maximum common subgraph computation, and it will also be shown that for a certain class of cost functions, the concept of graph edit distance is closely related with the minimum commonsupergraph.
Asymptotically optimal induced universal graphs
We prove that the minimum number of vertices of a graph that contains every graph on k vertices as an induced subgraph is $${(1+o(1)) 2^{(k-1)/2}}$$(1+o(1))2(k-1)/2. This improves earlier estimates
A Partitioning Algorithm for Maximum Common Subgraph Problems
This work introduces a new branch and bound algorithm for the maximum common subgraph and maximum common connected subgraph problems which is based around vertex labelling and partitioning which dramatically reduce the memory and computation requirements during search, and allow better dual viewpoint ordering heuristics to be calculated cheaply.
On minimal n-universal graphs
  • J. Moon
  • Mathematics
    Proceedings of the Glasgow Mathematical Association
  • 1965
A graph Gn consists of n distinct vertices x1x2, …, xn some pairs of which are joined by an edge. We stipulate that at most one edge joins any two vertices and that no edge joins a vertex to itself.
AllDifferent-based filtering for subgraph isomorphism
The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants
The Glasgow Subgraph Solver provides an implementation of state of the art algorithms for subgraph isomorphism problems, and is suitable for use on a wide range of graphs, including many that are found to be computationally hard by other solvers.
The igraph software package for complex network research
Platform-independent and open source igraph aims to satisfy all the requirements of a graph package while possibly remaining easy to use in interactive mode as well.
Tabu Search
From the Publisher: This book explores the meta-heuristics approach called tabu search, which is dramatically changing our ability to solve a hostof problems that stretch over the realms of resource
A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs
A new bit- and thread-parallel constraint-based search algorithm for the subgraph isomorphism problem, and a counting-based all-different propagator which is better suited for large domains is used.
Isomorph-Free Exhaustive Generation
We describe a very general technique for generating families of combinatorial objects without isomorphs. It applies to almost any class of objects for which an inductive construction process exists.