The price of connectedness in graph partitioning problems

In this work, we present some results coming from the comparison of two classes of problems of optimal graph partitioning. In the first class of problem, called further constrained problem, ones impose the nodes belonging to a same cluster to be connected. In the second class of problem, no constrai...

Full description

Saved in:

Bibliographic Details
Published in:	2019 18th European Control Conference (ECC) pp. 2313 - 2318
Main Authors:	Martin, Nicolas, Frasca, Paolo, Ishizaki, Takayuki, Imura, Jun-Ichi, Canudas-de-Wit, Carlos
Format:	Conference Proceeding
Language:	English
Published:	EUCA 01.06.2019
Subjects:	Degradation Europe Optimization
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!