Trimming weighted graphs of bounded treewidth

DOI10.1016/J.DAM.2011.07.023zbMath1241.05126OpenAlexW1963539025MaRDI QIDQ415289

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) Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Signed and weighted graphs (05C22)

Related Items (1)

A $$(2+\epsilon )$$-Approximation Algorithm for the Storage Allocation Problem

Cites Work

• Unnamed Item
• Graph minors. II. Algorithmic aspects of tree-width
• Trimming of Graphs, with Application to Point Labeling

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