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:
书目详细资料
主要作者: Trao, Hazim Michman
格式: Thesis
语言:English
出版: 2018
主题:
在线阅读:http://psasir.upm.edu.my/id/eprint/76910/1/FS%202018%2085%20-%20IR.pdf
标签: 添加标签
没有标签, 成为第一个标记此记录!