PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Alia G., Maestrini P. An approach to optimal partitioning of hypergraphs. In: ACM Annual Conference proceedings (S.Diego, Nov 1974). Proceedings, pp. 133 - 139. 1974.
 
 
Abstract
(English)
The problem of determining optimal partitions of hypergraphs ( or, more simply of ordinary graphs), is rilevant in several areas, such as computer aided design of printed boards, information retriveal and program paging. In many cases there exist optimal or near optimal partitions, subject to the constraint that each block is an LS set.
Subject hypergraphs, network flow, cutsets, computer-aided design.


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional