View in EDS PDF Full Text

A Generalized Implicit Enumeration Algorithm for Graph Coloring.

Saved in:
Bibliographic Details
Title: A Generalized Implicit Enumeration Algorithm for Graph Coloring.
Authors: Horowitz, Ellis, Kubale, Marek1, Jackowski, Boguslaw2
Source: Communications of the ACM. Apr1985, Vol. 28 Issue 4, p412-418. 7p. 1 Chart, 2 Graphs.
Subjects: Algorithms, Graph coloring, Graph theory, Backtrack programming, Computer programming, Sequential analysis
Abstract: A generalized algorithm for graph coloring by implicit enumeration is formulated. A number of backtracking sequential methods are discussed in terms of the generalized algorithm. Some are revealed to be partially correct and inexact. A few corrections to the invalid algorithms, which cause these algorithms to guarantee optimal solutions, are proposed. Finally, some computational results and remarks on the practical relevance of improved implicit enumeration algorithms are given. [ABSTRACT FROM AUTHOR]
Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 5225498
AccessLevel: 6
PubType: Periodical
PubTypeId: serialPeriodical
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: A Generalized Implicit Enumeration Algorithm for Graph Coloring.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Horowitz%2C+Ellis%22">Horowitz, Ellis</searchLink><br /><searchLink fieldCode="AR" term="%22Kubale%2C+Marek%22">Kubale, Marek</searchLink><relatesTo>1</relatesTo><br /><searchLink fieldCode="AR" term="%22Jackowski%2C+Boguslaw%22">Jackowski, Boguslaw</searchLink><relatesTo>2</relatesTo>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Communications+of+the+ACM%22">Communications of the ACM</searchLink>. Apr1985, Vol. 28 Issue 4, p412-418. 7p. 1 Chart, 2 Graphs.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+coloring%22">Graph coloring</searchLink><br /><searchLink fieldCode="DE" term="%22Graph+theory%22">Graph theory</searchLink><br /><searchLink fieldCode="DE" term="%22Backtrack+programming%22">Backtrack programming</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+programming%22">Computer programming</searchLink><br /><searchLink fieldCode="DE" term="%22Sequential+analysis%22">Sequential analysis</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: A generalized algorithm for graph coloring by implicit enumeration is formulated. A number of backtracking sequential methods are discussed in terms of the generalized algorithm. Some are revealed to be partially correct and inexact. A few corrections to the invalid algorithms, which cause these algorithms to guarantee optimal solutions, are proposed. Finally, some computational results and remarks on the practical relevance of improved implicit enumeration algorithms are given. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Communications of the ACM is the property of Association for Computing Machinery and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=5225498
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 7
        StartPage: 412
    Subjects:
      – SubjectFull: Algorithms
        Type: general
      – SubjectFull: Graph coloring
        Type: general
      – SubjectFull: Graph theory
        Type: general
      – SubjectFull: Backtrack programming
        Type: general
      – SubjectFull: Computer programming
        Type: general
      – SubjectFull: Sequential analysis
        Type: general
    Titles:
      – TitleFull: A Generalized Implicit Enumeration Algorithm for Graph Coloring.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Horowitz, Ellis
      – PersonEntity:
          Name:
            NameFull: Kubale, Marek
      – PersonEntity:
          Name:
            NameFull: Jackowski, Boguslaw
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 04
              Text: Apr1985
              Type: published
              Y: 1985
          Identifiers:
            – Type: issn-print
              Value: 00010782
          Numbering:
            – Type: volume
              Value: 28
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: Communications of the ACM
              Type: main
ResultId 1