Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

35

GD
2006
Springer

favoriteEmaildiscussreport

90views Computer Graphics» more GD 2006»

Partitions of Graphs into Trees

14 years 2 months ago

Partitions of Graphs into Trees

Download www.cs.uwaterloo.ca

In this paper, we study the k-tree partition problem which is a partition of the set of edges of a graph into k edge-disjoint trees. This problem occurs at several places with applications e.g. in network reliability and graph theory. In graph drawing there is the still unbeaten (n - 2)

Therese C. Biedl, Franz-Josef Brandenburg

Real-time Traffic

Computer Graphics | GD 2006 | K-tree Partition Problem | Maximal Planar | Maximal Planar Graphs |

claim paper

Related Content

» Partitions of Complete Geometric Graphs into Plane Trees

» Combining Tree Partitioning Precedence and Incomparability Constraints

» Graphs partitions and Fibonacci numbers

» On the Number of Graphical Forest Partitions

» Algebraic Operations on PQ Trees and Modular Decomposition Trees

» Normalized tree partitioning for image segmentation

» Augmented tree partitioning for interactive image segmentation

» Binomial Identities Generated by Counting Spanning Trees

» Computability of Width of Submodular Partition Functions

Post Info
More Details (n/a)

Added	23 Aug 2010
Updated	23 Aug 2010
Type	Conference
Year	2006
Where	GD
Authors	Therese C. Biedl, Franz-Josef Brandenburg

Comments (0)