On integer linear programs for treewidth based on perfect elimination orderings

DOI10.1007/978-3-031-34347-6_25MaRDI QIDQ6182913zbMATH OpenOpenAlexFDO

Authors Sven Mallach

Publication date 22 December 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-34347-6_25

zbMATH Keywords

linear programmingtreewidthInteger programming

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Cites work

• scientific article; zbMATH DE number 1670532 (Why is no real title available?)
• scientific article; zbMATH DE number 2086253 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 4060712 (Why is no real title available?)
• A branch and bound algorithm for the matrix bandwidth minimization
• A note on exact algorithms for vertex ordering problems on graphs
• Black-white pebbles and graph separation
• Complexity of Finding Embeddings in a k-Tree
• Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
• Graph minors. II. Algorithmic aspects of tree-width
• Jdrasil: a modular library for computing tree decompositions
• On Exact Algorithms for Treewidth
• On rigid circuit graphs
• Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs
• The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• Variable neighborhood search for the vertex separation problem

This page was built for publication: On integer linear programs for treewidth based on perfect elimination orderings

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