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.
1974
Istituto di Scienza e Tecnologie dell'Informazione "Alessandro Faedo" - ISTI
hypergraphs
network flow
cutsets
computer-aided design
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.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.14243/408418
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 2
  • ???jsp.display-item.citation.isi??? ND
social impact