View in EDS HTML Full Text PDF Full Text

Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width.

Saved in:
Bibliographic Details
Title: Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width.
Authors: Courcelle, B., Makowsky, J. A., Rotics, U.
Source: Theory of Computing Systems. Mar/Apr2000, Vol. 33 Issue 2, p125. 26p.
Subjects: Decomposition method, Algorithms
Abstract: Discusses the development of applications for graphs of clique-width and cographs. Theorems; Graph presentations for logically oriented work; Linear algorithms for optimization problems on P[sub 4]-sparse graphs.
Database: Engineering Source
Full text is not displayed to guests.
FullText Links:
  – Type: pdflink
Text:
  Availability: 1
Header DbId: egs
DbLabel: Engineering Source
An: 3800938
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22Courcelle%2C+B%2E%22">Courcelle, B.</searchLink><br /><searchLink fieldCode="AR" term="%22Makowsky%2C+J%2E+A%2E%22">Makowsky, J. A.</searchLink><br /><searchLink fieldCode="AR" term="%22Rotics%2C+U%2E%22">Rotics, U.</searchLink>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Theory+of+Computing+Systems%22">Theory of Computing Systems</searchLink>. Mar/Apr2000, Vol. 33 Issue 2, p125. 26p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Decomposition+method%22">Decomposition method</searchLink><br /><searchLink fieldCode="DE" term="%22Algorithms%22">Algorithms</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: Discusses the development of applications for graphs of clique-width and cographs. Theorems; Graph presentations for logically oriented work; Linear algorithms for optimization problems on P[sub 4]-sparse graphs.
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=3800938
RecordInfo BibRecord:
  BibEntity:
    Identifiers:
      – Type: doi
        Value: 10.1007/s002249910009
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 26
        StartPage: 125
    Subjects:
      – SubjectFull: Decomposition method
        Type: general
      – SubjectFull: Algorithms
        Type: general
    Titles:
      – TitleFull: Linear Time Solvable Optimization Problems on Graphs of Bounded Clique-Width.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: Courcelle, B.
      – PersonEntity:
          Name:
            NameFull: Makowsky, J. A.
      – PersonEntity:
          Name:
            NameFull: Rotics, U.
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 03
              Text: Mar/Apr2000
              Type: published
              Y: 2000
          Identifiers:
            – Type: issn-print
              Value: 14324350
          Numbering:
            – Type: volume
              Value: 33
            – Type: issue
              Value: 2
          Titles:
            – TitleFull: Theory of Computing Systems
              Type: main
ResultId 1