Edge-Packing Planar Graphs by Cyclic Graphs

Simple item page
dc.contributor.authorHeath, Lenwood S.en
dc.contributor.authorVergara, John Paul C.en
dc.contributor.departmentComputer Scienceen
dc.date.accessioned2013-06-19T14:36:34Zen
dc.date.available2013-06-19T14:36:34Zen
dc.date.issued1996-11-01en
dc.description.abstractMaximum G Edge-Packing 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 considers the cases where G and H are planar and G is cyclic. Recent work on the general problem is surveyed, inadequacies and limitations in these results are identified, and NP-completeness proofs for key cases are presented.en
dc.description.notesWe do not have an online version of this Technical Report.en
dc.format.mimetypeapplication/postscripten
dc.identifierhttp://eprints.cs.vt.edu/archive/00000454/en
dc.identifier.sourceurlhttp://eprints.cs.vt.edu/archive/00000454/01/NotOnline.htmlen
dc.identifier.trnumberTR-96-15en
dc.identifier.urihttp://hdl.handle.net/10919/19956en
dc.language.isoenen
dc.publisherDepartment of Computer Science, Virginia Polytechnic Institute & State Universityen
dc.relation.ispartofHistorical Collection(Till Dec 2001)en
dc.rightsIn Copyrighten
dc.rights.urihttp://rightsstatements.org/vocab/InC/1.0/en
dc.titleEdge-Packing Planar Graphs by Cyclic Graphsen
dc.typeTechnical reporten
dc.type.dcmitypeTexten

Files

Collections

Computer Science Technical Reports