A Note on Exact Algorithms for Vertex Ordering Problems on Graphs

@article{Bodlaender2011ANO,
  title={A Note on Exact Algorithms for Vertex Ordering Problems on Graphs},
  author={Hans L. Bodlaender and F. Fomin and Arie M. C. A. Koster and Dieter Kratsch and Dimitrios M. Thilikos},
  journal={Theory of Computing Systems},
  year={2011},
  volume={50},
  pages={420-432}
}
In this note, we give a proof that several vertex ordering problems can be solved in O∗(2n) time and O∗(2n) space, or in O∗(4n) time and polynomial space. The algorithms generalize algorithms for the Travelling Salesman Problem by Held and Karp (J. Soc. Ind. Appl. Math. 10:196–210, 1962) and Gurevich and Shelah (SIAM J. Comput. 16:486–502, 1987). We survey a number of vertex ordering problems to which the results apply. 

Algorithmic aspects of some vertex ordering problems

TLDR
This thesis focuses on three different vertex ordering problems, considers a variant of Directed Feedback Arc Set problem with applications in computational biology, and presents an efficient heuristic algorithm for this problem and a general algorithmic strategy for the problem.

A note on Integer Linear Programming formulations for linear ordering problems on graphs

TLDR
This paper uses a new set of constraints for modeling linear ordering problems on graphs using Integer Linear Programming to propose new ILP formulations for well-known linear ordering optimization problems, namely the Pathwidth, Cutwidth, Bandwidth, SumCut and Optimal Linear Arrangement problems.

Computing the pathwidth of directed graphs with small vertex cover

Exact Algorithms for Intervalizing Coloured Graphs

TLDR
This work gives an exact algorithm that uses 2O(n/logn)$2^{\mathcal {O} (n/\log n)}$ time and an O∗(2n)$\mathcal{O}^{\ast }(2^{n})$ algorithm for the case that the number of colors is not fixed.

On exact algorithms for treewidth

TLDR
Experimental and theoretical results on the problem of computing the treewidth of a graph by exact exponential-time algorithms using exponential space or using only polynomial space are given and it is shown that with a more complicated algorithm using balanced separators, Treewidth can be computed in O*(2.9512n) time and polynometric space.

Computing Directed Pathwidth in O(1.89 n ) Time

TLDR
This is the first algorithm with running time better than the straightforward O*(2n) time for computing the directed pathwidth of a digraph with n vertices, and as a special case, it computes the path width of an undirected graph in the same time.

Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem

TLDR
This work considers the task to compute the pathwidth of a graph which has been shown to be equivalent to the vertex separation problem, and presents a new formulation based on conventional linear ordering variables and a slightly different perspective on the problem that sustains stronger lower bounds.

Quantum speedups for dynamic programming on n-dimensional lattice graphs

TLDR
This paper examines a generalization of the Boolean hypercube graph, the n-dimensional lattice graph Q(D,n) with vertices in {0, 1, . . . , D}n, and shows a quantum algorithm with complexity Õ(T D), where TD < D + 1, and applies it to the Set Multicover problem.

Discretization vertex orders in distance geometry

...

References

SHOWING 1-10 OF 16 REFERENCES

Exact (Exponential) Algorithms for Treewidth and Minimum Fill-In

We show that for a graph G on n vertices its treewidth and minimum fill-in can be computed roughly in 1.9601 n time. Our result is based on a combinatorial proof that the number of minimal separators

On exact algorithms for treewidth

TLDR
Experimental and theoretical results on the problem of computing the treewidth of a graph by exact exponential-time algorithms using exponential space or using only polynomial space are given and it is shown that with a more complicated algorithm using balanced separators, Treewidth can be computed in O*(2.9512n) time and polynometric space.

Exact Algorithms for Treewidth and Minimum Fill-In

TLDR
It is shown that the treewidth and the minimum fill-in of an $n$-vertex graph can be computed in time $\mathcal{O}(1.8899^n)$ and the running time of the algorithms can be reduced to 1.4142 minutes.

Computing Pathwidth Faster Than 2n

Computing the Pathwidth of a graph is the problem of finding a tree decomposition of minimum width, where the decomposition tree is a path. It can be easily computed in $\mathcal{O}^*(2^n)$ time by

Some Simplified NP-Complete Graph Problems

Treewidth computation and extremal combinatorics

TLDR
It is proved that every graph on nvertices contains at most $n\binom{b+f}{b}$ such vertex subsets, and this result from extremalcombinatorics appears to be very useful in the design of severalumeration and exact algorithms.

The Vertex Separation Number of a Graph equals its Path-Width

Finding Induced Subgraphs via Minimal Triangulations

TLDR
It is shown that given an n-vertex graph G together with its set of potential maximal cliques, and an integer t, it is possible in time the number of potentialmaximal cliques times O(n^{O(t)}) to find a maximum induced subgraph of treewidth t in G and for a given graph F to decide if G contains an induced sub graph isomorphic to F.

Improved Exponential-Time Algorithms for Treewidth and Minimum Fill-In

TLDR
It is shown that the number of potential maximal cliques for an arbitrary graph G on n vertices is ${\mathcal O}^{*}$(1.8135n), and that all potential maximalCliques can be listed in ${\ mathcal O]^{*]$ (1.8899n) time.

Heuristic and metaheuristic methods for computing graph treewidth

TLDR
This paper proposes two new methods for computing the treewidth of graphs: a heuristic and a metaheuristic, which returns good results in a short computation time, and identifies properties of the triangulation process to optimize the computing time of the method.