scientific article; zbMATH DE number 2190098

MaRDI QIDQ5462155zbMATH OpenFDO

Authors Jitender Deogun, Zsolt Tuza, Stephen D. Scott, Lin Li

Publication date 1 August 2005

zbMATH Keywords

boundsNP-hardness

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Minimum weight \(H\)-decompositions of graphs: the bipartite case
• Edge decompositions into two kinds of graphs
• Edge decompositions and rooted packings of graphs
• Minimum \(H\)-decompositions of graphs
• On the complexity of some edge-partition problems for graphs

Cited in

(7)

• Decomposing weighted digraphs into sums of chains
• Weighted skeletons and fixed-share decomposition
• scientific article; zbMATH DE number 5902595 (Why is no real title available?)
• Edge Weight Reduction Problems in Directed Acyclic Graphs
• Recognizing weighted directed cartesian graph bundles
• scientific article; zbMATH DE number 1894958 (Why is no real title available?)
• Edge-Cuts of Optimal Average Weights

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 Q5462155)