The Uniform Partition (UP) and the Simple Max Partition (SMP) problems are NP-complete graph partitioning problems, and polynomial-time algorithms are known for few classes of graphs only. In the present paper, the class of line-graphs is considered and a polynomial algorithm is proposed to solve both problems in this class. A similar result can be obtained extending the class to digraphs.
A Polynomial Characterization of Some Graph Partitioning Problems
ARBIB, CLAUDIO
1988-01-01
Abstract
The Uniform Partition (UP) and the Simple Max Partition (SMP) problems are NP-complete graph partitioning problems, and polynomial-time algorithms are known for few classes of graphs only. In the present paper, the class of line-graphs is considered and a polynomial algorithm is proposed to solve both problems in this class. A similar result can be obtained extending the class to digraphs.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.
