Profile minimization on compositions of graphs
顯示簡易詮釋資料 統計資料| 欄位 | 內容 | 語言 |
|---|---|---|
dc.citation.epage |
190 | en_US |
dc.citation.issue |
2-3 | en_US |
dc.citation.spage |
177 | en_US |
dc.citation.volume |
14 | en_US |
dc.contributor.author |
Tsao, Yu-Ping | en_US |
dc.contributor.author |
Chang, Gerard J. | en_US |
dc.contributor.department |
應用數學系 | zh_TW |
dc.contributor.department |
Department of Applied Mathematics | en_US |
dc.date.accessioned |
2014-12-08T15:05:28Z | |
dc.date.available |
2014-12-08T15:05:28Z | |
dc.date.issued |
2007-10-01 | en_US |
dc.description.abstract |
The profile minimization problem arose from the study of sparse matrix technique. In terms of graphs, the problem is to determine the profile of a graph G which is defined as P(G) = min(f) Sigma(v epsilon V(G)) max(x epsilon N[v]) (f(v) - f(x)), where f runs over all bijections from V(G) to {1,2,...,vertical bar V(G)vertical bar} and N[v] = {v} boolean OR {x epsilon V(G): xv epsilon E(G)}. This is equivalent to the interval graph completion problem, which is to find a super-graph of a graph G with as few number of edges as possible. The purpose of this paper is to study the profiles of compositions of two graphs. | en_US |
dc.identifier.doi |
10.1007/s10878-007-9061-9 | en_US |
dc.identifier.issn |
1382-6905 | en_US |
dc.identifier.journal |
JOURNAL OF COMBINATORIAL OPTIMIZATION | en_US |
dc.identifier.uri |
http://dx.doi.org/10.1007/s10878-007-9061-9 | en_US |
dc.identifier.uri |
https://ir.lib.nycu.edu.tw/handle/11536/4007 | |
dc.identifier.wosnumber |
WOS:000248864800008 | |
dc.language.iso |
en_US | en_US |
dc.subject |
profile | en_US |
dc.subject |
composition | en_US |
dc.subject |
interval graph | en_US |
dc.subject |
chordal graph | en_US |
dc.subject |
simplicial vertex | en_US |
dc.subject |
join | en_US |
dc.subject |
cycle | en_US |
dc.title |
Profile minimization on compositions of graphs | en_US |
dc.type |
Article; Proceedings Paper | en_US |
檔案
- 000248864800008.pdf (384.6 KB, Adobe PDF)
所屬典藏: 會議論文