On integer linear programs for treewidth based on perfect elimination orderings

DOI10.1007/978-3-031-34347-6_25OpenAlexW4379118058MaRDI QIDQ6182913FDOQ6182913

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

• Jdrasil: A Modular Library for Computing Tree Decompositions
• Title not available (Why is that?)
• Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
• A note on exact algorithms for vertex ordering problems on graphs
• Title not available (Why is that?)
• Complexity of Finding Embeddings in a k-Tree
• On Exact Algorithms for Treewidth
• On rigid circuit graphs
• Graph minors. II. Algorithmic aspects of tree-width
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• A branch and bound algorithm for the matrix bandwidth minimization
• Variable neighborhood search for the vertex separation problem
• Black-white pebbles and graph separation
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs

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)