This thesis surveys major algorithmic developments for computing treewidth and discusses the compression and improvement paradigm developed in the 1990s, especially in the work of Bodlaender and Kloks, and Bodlaender and Hagerup.
Treewidth is a fundamental graph invariant that quantifies how tree-like a given graph is. It is extensively used with dynamic programming to design fixed-parameter tractable algorithms for many NP-hard graph combinatorial optimization problems. However, despite broad theoretical applicability, treewidth dynamic progra...
Jialiang Li, Aneta Neumann, Frank Neumann et al.· 0 citations
Tree-encoded partitionings of graphs are fundamental tools for the decomposition and approximation of graph signals. For the efficient approximation of such graph signals, we develop strategies based on $hp$-refinement by combining domain decomposition with an improved local approximation using polynomials of higher de...
Graph search algorithms and their corresponding graph search trees are commonly used in algorithmic graph theory. In recent years, the recognition problem of these graph search trees has received significant attention. So far, the research has focused on two types of search trees: first-in trees that behave like BFS-tr...
A unified Parallel Evolutionary Algorithm Framework (PEAF) is proposed, which combines structure-inheriting crossover operators, a hierarchical mutation mechanism based on the Multiple Mutation Heuristic and the Auxiliary Cut Mutation Heuristic, and a diversity-preserving selection strategy.
What problems can one solve on a tournament if only its score sequence is known? Tournaments are oriented complete graphs that form an extensively-studied class of directed graphs (digraphs), both from combinatorial and algorithmic perspectives. Over the years, researchers have identified multiple classical digraph pro...
Prantar Ghosh, Sahil Kuchlous, Shravan Mehra et al.· Embedded Systems and Applica...· 0 citations
