On some packing and partition problems in geometric graphs

Graph packing problem refers to the problem of finding maximum number of edge-disjoint copies of a fixed subgraph in a given graph G. A related problem is the partition problem. In this case, the edge-disjoint subgraphs are sought but require that the union of subgraphs in this packing is exactly...

Full description

Saved in:
Bibliographic Details
Main Author: Trao, Hazim Michman
Format: Thesis
Language:English
Published: 2018
Subjects:
Online Access:http://psasir.upm.edu.my/id/eprint/76910/1/FS%202018%2085%20-%20IR.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!