A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators

DOI10.1007/11917496_5MaRDI QIDQ3522941zbMATH OpenOpenAlexFDO

Authors Christian Knauer, Andreas Spillner

Publication date 4 September 2008

Published in Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11917496_5

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM
• The minimum weight triangulation problem with few inner points
• Parameterized and Exact Computation
• Algorithms and Computation
• A fixed parameter algorithm for optimal convex partitions

Cited in

(4)

• On a linear program for minimum-weight triangulation
• Parameterized and Exact Computation
• The minimum weight triangulation problem with few inner points
• FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM

This page was built for publication: A Fixed-Parameter Algorithm for the Minimum Weight Triangulation Problem Based on Small Graph Separators

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