The tree decomposition of graphs is a fundamental algorithmic tool. It has been shown that difficult problems, such as some NP-complete ones, can be solved efficiently over classes of graphs of ...

Given a graph in sage structure or an adjacency list of the graph, returns the modular decomposition tree (cotree), if the input graph is cograph. Functions included: Cograph_recognition: Contains 3 ...

This repository is for MOLDR: Molecular Graph Generation by Decomposition and Reassembling. In the decomposition step, molecules are decomposed into subgraphs using gSpan. Choose the "raw" ...

It is well-known that dynamic programming algorithms can utilize tree decompositions to provide a way to solve some \emph{NP}-hard problems on graphs where the complexity is polynomial in the number ...

The quantum approximate optimization algorithm (QAOA) has the potential to approximately solve complex combinatorial optimization problems in polynomial time. However, current noisy quantum devices ...

Graphs are a model of many real world phenomena, e.g., social networks, road networks, electricity networks, control flow graphs of computer programs. We study efficient algorithms to solve research ...

The tree decomposition of graphs is a fundamental algorithmic tool. It has been shown that difficult problems, such as some NP-complete ones, can be solved efficiently over classes of graphs of ...