Maximum packing for k-connected partial k-trees in polynomial time

• Authors:

• Anders Dessmark;Andrzej Lingas;Andrzej Proskurowski

• Affiliations:

• Lund Univ., Lund, Sweden;Lund Univ., Lund, Sweden;Univ. of Oregon, Eugene, OR

• Venue:
• Theoretical Computer Science - Trees in algebra and programming
• Year:
• 2000