Edge Disjoint Polyp Packing

Abstract

A graph is called a p{polyp if it consists of p simple paths of the same length and one endvertex of all these paths is a common vertex. The Polyp Packing problem is a generalization of the well known Bin Packing problem: How to pack a set of paths with diierent lengths to a set of polyps edge disjointly? It is proved that the Polyp Packing problem is NP… (More)
DOI: 10.1016/S0166-218X(97)00025-5

Topics

Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics