Partitioning Bispanning Graphs into Spanning Trees

Document type:: Technical Report
Author(s):: Matthias Baumgart
Title:: Partitioning Bispanning Graphs into Spanning Trees
Abstract:: Given a weighted bispanning graph B=(V,P,Q) consisting of two edge-disjoint spanning trees P and Q such that w(P)«
Given a weighted bispanning graph B=(V,P,Q) consisting of two edge-disjoint spanning trees P and Q such that w(P)»
Keywords:: Bispanning graph; edge-disjoint spanning trees; tree graph; number of spanning trees
Year:: 2008
Year / month:: 2008-05-01 00:00:00
Pages:: 18
BibTeX

Occurrences: