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...
Saved in:
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 http://psasir.upm.edu.my/id/eprint/76910/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Packing 1-plane Hamiltonian cycles in complete geometric graphs
by: Trao, Hazim Michman, et al.
Published: (2019) -
Restricted triangulation on circulant graphs
by: Ali, Niran Abbas, et al.
Published: (2018) -
The partitioning technique of directed cyclic graph for task assignment problem
by: Ariffin, W. N. M., et al.
Published: (2016) -
Triangulability of convex graphs and convex skewness
by: Ali, Niran Abbas, et al.
Published: (2021) -
Partitioning technique for transformation of connected graphs into single-row networks
by: Loh, S., et al.
Published: (2011)