Publication:4224923

From MaRDI portal
Revision as of 15:55, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


zbMath0918.68078MaRDI QIDQ4224923

Romeo Rizzi, Alan A. Bertossi, Roberto Battiti

Publication date: 11 April 1999


zbMATH Keywords

hypergraph partitioning; randomized greedy construction schemes


Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

90B18: Communication networks in operations research

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

90C27: Combinatorial optimization

68W10: Parallel algorithms in computer science

68P05: Data structures


Related Items

On partitioning of hypergraphs



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4224923&oldid=18096418"
Powered by MediaWiki