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.
An approach to optimal partitioning of hypergraphs
1974
Abstract
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.File in questo prodotto:
File | Dimensione | Formato | |
---|---|---|---|
prod_422986-doc_150515.pdf
accesso aperto
Descrizione: An approach to optimal partitioning of hypergraphs
Tipologia:
Versione Editoriale (PDF)
Dimensione
1.23 MB
Formato
Adobe PDF
|
1.23 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.