Trimming weighted graphs of bounded treewidth

DOI10.1016/J.DAM.2011.07.023MaRDI QIDQ415289zbMATH OpenOpenAlexFDO

Authors David Michael Knipe

Publication date 11 May 2012

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2011.07.023

zbMATH Keywords

treewidthgraph trimmingmap labelling

Mathematics Subject Classification ID

Trees (05C05) Distance in graphs (05C12) Signed and weighted graphs (05C22) Structural characterization of families of graphs (05C75) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Tree-Width and Optimization in Bounded Degree Graphs
• Approximating sparsest cut in graphs of bounded treewidth
• Publication:4734761
• scientific article; zbMATH DE number 932194
• Evaluating a weighted graph polynomial for graphs of bounded tree-width
• A managed Bayesian risk approach for decision making alternatives
• scientific article; zbMATH DE number 1875430
• Weighted proper orientations of trees and graphs of bounded treewidth
• On bounded-degree vertex deletion parameterized by treewidth

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• Graph minors. II. Algorithmic aspects of tree-width
• Trimming of graphs, with application to point labeling

Cited in

(3)

• A \((2+\varepsilon)\)-approximation algorithm for the storage allocation problem
• Trimming of graphs, with application to point labeling
• Trimming of graphs, with application to point labeling

This page was built for publication: Trimming weighted graphs of bounded treewidth

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