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

DOI10.1007/BF02575895zbMATH Open0528.68044OpenAlexW2059147760MaRDI QIDQ786539FDOQ786539

Authors: 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

• Title not available (Why is that?)
• Assignment of Tasks in a Distributed Processor System with Limited Memory
• Efficient Algorithm for the Partitioning of Trees
• Title not available (Why is that?)
• Improving locality by critical working sets

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q786539)