Decoding tree decompositions from permutations

DOI10.1007/978-3-031-55598-5_2MaRDI QIDQ6547914

Uéverton S. Souza, Samuel Eduardo da Silva

Publication date: 31 May 2024

zbMATH Keywords

decodertreewidthtree decompositionperfect elimination order

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Title not available (Why is that?)
• On rigid circuit graphs
• Turbocharging treewidth heuristics
• Incidence matrices and interval graphs
• Positive-instance driven dynamic programming for treewidth
• Complexity of Finding Embeddings in a k-Tree
• Algorithmic Aspects of Vertex Elimination on Graphs
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Jdrasil: A Modular Library for Computing Tree Decompositions
• Parameterized Algorithms
• Chordal graphs and their clique graphs

This page was built for publication: Decoding tree decompositions from permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547914)