Two NP-complete unweighted graph partitioning problems are considered: Simple Max Partitioning (SMP) and Uniform Graph Partitioning (UGP). For both problems, polynomial-time algorithms are available for special classes of graphs. In the present paper, the class of line-graphs is considered and a polynomial algorithm is proposed to solve both UGP and SMP in this class.
A Polynomial Algorithm for Partitioning Line-graphs
ARBIB, CLAUDIO
1989-01-01
Abstract
Two NP-complete unweighted graph partitioning problems are considered: Simple Max Partitioning (SMP) and Uniform Graph Partitioning (UGP). For both problems, polynomial-time algorithms are available for special classes of graphs. In the present paper, the class of line-graphs is considered and a polynomial algorithm is proposed to solve both UGP and SMP in this class.File in questo prodotto:
Non ci sono file associati a questo prodotto.
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
