scientific article; zbMATH DE number 6469175

MaRDI QIDQ5501290zbMATH OpenFDO

Authors Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer

Publication date 3 August 2015

zbMATH Keywords

complexitycrossing numberiterated roundinglinear programming relaxationmatchingspanning treestabbing numbertriangulation

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25) Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Minimizing the stabbing number of matchings, trees, and triangulations
• Efficiently enumerating minimal triangulations
• Minimizing the algebraic connectivity of trees with given matching number
• The minimum stabbing triangulation problem: IP models and computational evaluation
• Minimum T-cuts and optimal T-pairings
• Maximum cardinality search for computing minimal triangulations of graphs
• On the number of minimum dominating sets in trees
• Minimal triangulations of graphs: a survey
• scientific article; zbMATH DE number 4047157
• The minimum number of spanning trees in regular multigraphs

Cited in

(4)

• Minimizing the stabbing number of matchings, trees, and triangulations
• Convex subdivisions with low stabbing numbers
• The minimum stabbing triangulation problem: IP models and computational evaluation
• Escaping the curse of spatial partitioning: matchings with low crossing numbers and their applications

This page was built for publication:

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