Solving the maximally balanced connected partition problem in graphs by using genetic algorithm

Đurić, Brankica; Kratica, Jozef; Tošić, Dušan; Filipović, Vladimir

Results

eNauka > Results > Solving the maximally balanced connected partition problem in graphs by using genetic algorithm

Title:	Solving the maximally balanced connected partition problem in graphs by using genetic algorithm
Authors:	Đurić, Brankica; Kratica, Jozef ; Tošić, Dušan ; Filipović, Vladimir
Issue Date:	2008
Publication:	Computing and Informatics
ISSN:	1335-9150 Computing and Informatics Search Idenfier
Publisher:	Slovak Academy of Sciences
Type:	Article
Collation:	vol. 27 br. 3 str. 341-354
WoS-ID:	000257411500003
Scopus-ID:	2-s2.0-47249137773
URI:	https://enauka.gov.rs/handle/123456789/577782 http://researchrepository.mi.sanu.ac.rs/handle/123456789/501
Project:	Serbian Ministry of Science and Ecology, project 144007
M-category:	23M23

18
SCOPUS^TM

16
WEB OF SCIENCE^TM

Find the DOI

Finding a DOI in CrossRef based on publication meta-data. The DOI (and metadata) with the similar data match will be displayed. ATTENTION - it doesn't have to be that publication.