Un algoritmo per il partizionamento ottimo di una nuova classe di grafi

DOI10.1007/BF02575895zbMath0528.68044OpenAlexW2059147760MaRDI QIDQ786539

N. E. Zubov

Publication date: 1983

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02575895

zbMATH Keywords

combinatorial optimizationgraph partitioningcomputer system

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Theory of software (68N99)

Cites Work

• Unnamed Item
• Unnamed Item
• Assignment of Tasks in a Distributed Processor System with Limited Memory
• Improving locality by critical working sets
• Efficient Algorithm for the Partitioning of Trees

This page was built for publication: Un algoritmo per il partizionamento ottimo di una nuova classe di grafi