The subgraph isomorphism problem involves deciding whether a copy of a pattern graph
occurs inside a larger target graph. The non-induced version allows extra edges in the …

We prove that for k≪ 4√ n regular resolution requires length n Ω (k) to establish that an
Erdős–Rényi graph with appropriately chosen edge density does not contain ak-clique. This …

The maximum common subgraph of two graphs is the largest possible common subgraph,
ie, the common subgraph with as many vertices as possible. Even if this problem is very …

This dissertation introduces the MCSPLIT family of algorithms for two closely-related NP-
hard problems that involve finding a large induced subgraph contained by each of two input …

Exact combinatorial search is essential to a wide range of application areas including
constraint optimisation, graph matching, and computer algebra. Solutions to combinatorial …

The Maximum Common Subgraph problem has been long proven NP-hard. Nevertheless, it
has countless practical applications, and researchers are still searching for exact solutions …

Exact combinatorial search is essential to a wide range of important applications, and there
are many large problems that need to be solved quickly. Searches are extremely …

The Maximum Common Subgraph is a computationally challenging problem with countless
practical applications. Even if it has been long proven NP-hard, its importance still motivates …

Propositional proof complexity is a field in theoretical computer science that analyses the
resources needed to prove statements. In this thesis, we are concerned about the length of …

Graphs have great representational power, and can thus efficiently represent complex
structures, such as chemical compounds and social networks. A common problem that often …