# Edge-Packing in Planar Graphs

1995) Edge-Packing in Planar Graphs. Technical Report ncstrl.vatech_cs//TR-95-18, Computer Science, Virginia Polytechnic Institute and State University. (

Full text available as: |

## Abstract

Maximum G Edge-Packing (EPack-sub G) is the problem of finding the maximum number of edge-disjoint isomorphic copies of a fixed guest graph G in a host graph H. This paper investigates the computational complexity of edge-packing for planar guests and planar hosts. Edge-packing is solvable in polynomial time when both G and H are either a 3-cycle or a k-star (graphs isomorphic to K(sub 1,k). Edge-packing is NP-complete when H is planar and G is either a cycle or a tree with greater than or equal to 3 edges. A strategy for developing polynomial-time approximation algorithms for planar hosts is exemplified by a linear-time approximation algorithm that finds a k-star edge-packing of size at least 1/2 optimal.

Item Type: | Departmental Technical Report |
---|---|

Subjects: | Computer Science > Historical Collection(Till Dec 2001) |

ID Code: | 433 |

Deposited By: | User autouser |

Deposited On: | 05 December 2001 |

Alternative Locations: | URL:ftp://ei.cs.vt.edu/pub/TechnicalReports/1995/TR-95-18.ps.gz, URL:http://historical.ncstrl.org/tr/ps/vatech_cs/TR-95-18.ps |