k-Phase Oscillator Synchronization for Graph Coloring

Lee, SA

k-Phase Oscillator Synchronization for Graph Coloring

Lee, SA

Permalink

Publisher:: Birkhauser Basel
Publication Type:: Journal Article
Citation:: Mathematics in Computer Science, 2010, 3, 1, pp. 323 - 342
Issue Date:: 2010-01

Closed Access

	Filename	Description	Size
	2009000478OK.pdf		357.87 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Lee, SA
dc.date	2005-11-30
dc.date.accessioned	2012-02-02T10:26:19Z
dc.date.issued	2010-01
dc.identifier.citation	Mathematics in Computer Science, 2010, 3, 1, pp. 323 - 342
dc.identifier.other	C1	en_US
dc.identifier.uri	http://hdl.handle.net/10453/15232
dc.description.abstract	This paper investigates ways of applying oscillator synchronization to graph coloring. A previous method based on the generalization of the Aihara model is sensitive to the varying degree of the vertices in the graph and there is a strong tendency for the network to form suboptimal limit cycles on regular graphs. Other models such as those by Wu and Nakaguchi, Jinâno and Tanaka do not generalize well into greater than 2-coloring. In this paper, we present ways to overcome these problems and describe the results of our experiments on graphs requiring more than two colors. Our k-phase model enhances the coloring performance over the previous similar models. We further attempt to formalize and analyze the categorical behavior of these systems and discuss connections to other optimization methods.
dc.publisher	Birkhauser Basel
dc.relation.ispartof	Mathematics in Computer Science
dc.rights	info:eu-repo/semantics/closedAccess
dc.subject	Graph coloring - Phase coupled oscillators - k-Phase oscillator synchronization	en_US
dc.subject	repertory grid, creativity, collaboration
dc.subject	repertory grid
dc.subject	creativity
dc.subject	collaboration
dc.subject.classification	Other Information and Computing Sciences	en_US
dc.title	k-Phase Oscillator Synchronization for Graph Coloring
dc.type	Journal Article
utslib.citation.volume	3
utslib.citation.number	1	en_US
utslib.location	Basel	en_US
utslib.citation.startpage	323	en_US
utslib.citation.endpage	342	en_US
utslib.identifier.org	FEIT.School of Systems, Management and Leadership	en_US
utslib.for	0899 Other Information and Computing Sciences
pubs.embargo.period	Not known
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Software
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Systems, Management and Leadership
pubs.organisational-group	/University of Technology Sydney/Strength - Human Centred Technology Design
utslib.copyright.status	closed_access
pubs.declined	1970-01-01T00:00:00.0+1000

Abstract:

This paper investigates ways of applying oscillator synchronization to graph coloring. A previous method based on the generalization of the Aihara model is sensitive to the varying degree of the vertices in the graph and there is a strong tendency for the network to form suboptimal limit cycles on regular graphs. Other models such as those by Wu and Nakaguchi, Jinâno and Tanaka do not generalize well into greater than 2-coloring. In this paper, we present ways to overcome these problems and describe the results of our experiments on graphs requiring more than two colors. Our k-phase model enhances the coloring performance over the previous similar models. We further attempt to formalize and analyze the categorical behavior of these systems and discuss connections to other optimization methods.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/15232