scientific article

zbMath0489.68066MaRDI QIDQ3951567

No author found.

Publication date: 1982

Full work available at URL: https://eudml.org/doc/92165

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

starscycleschainsbinary trees

Mathematics Subject Classification ID

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

Related Items (4)

A polynomial characterization of some graph partitioning problems ⋮ Solving graph partitioning on sparse graphs: cuts, projections, and extended formulations ⋮ Un algoritmo per il partizionamento ottimo di una nuova classe di grafi ⋮ Combinatorial analysis (nonnegative matrices, algorithmic problems)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Optimal Partitioning of Graphs
• Assignment of Tasks in a Distributed Processor System with Limited Memory
• Efficient Algorithm for the Partitioning of Trees
• Module Clustering to Minimize Delay in Digital Networks

This page was built for publication: