Skip to content
VuFind
English
Deutsch
Español
Français
Italiano
日本語
Nederlands
Português
Português (Brasil)
中文(简体)
中文（繁體）
Türkçe
עברית
Gaeilge
Cymraeg
Ελληνικά
Català
Euskara
Русский
Čeština
Suomi
Svenska
polski
Dansk
slovenščina
اللغة العربية
বাংলা
Galego
Tiếng Việt
Hrvatski
हिंदी
Հայերէն
Українська
Sámegiella
Монгол
Language
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
On approximate graph colouring...
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Permanent link
On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function
Bibliographic Details
Main Authors:
de Klerk, E
,
Pasechnik, D
,
Warners, J
Format:
Journal article
Published:
2004
Holdings
Description
Similar Items
Staff View
Description
Summary:
Similar Items
On approximate graph colouring and max-k-cut algorithms based on the θ-function
by: Klerk, Etienne de., et al.
Published: (2013)
On the Lovász ϑ-number of almost regular graphs with application to Erdős–Rényi graphs
by: Sotirov, R., et al.
Published: (2012)
Approximation of the stability number of a graph via copositive programming
by: de Klerk, E, et al.
Published: (2002)
Approximation of the stability number of a graph via copositive programming
by: Klerk, Etienne de., et al.
Published: (2011)
On the max-cut of sparse random graphs
by: Gamarnik, David, et al.
Published: (2019)