Partitioning Bispanning Graphs into Spanning Trees

Dokumenttyp:: Technical Report
Autor(en):: Matthias Baumgart
Titel:: 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)»
Stichworte:: Bispanning graph; edge-disjoint spanning trees; tree graph; number of spanning trees
Jahr:: 2008
Jahr / Monat:: 2008-05-01 00:00:00
Seiten/Umfang:: 18
BibTeX

Vorkommen: