Restrictions of graph partition problems. I (Q672380): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A Linear Recognition Algorithm for Cographs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3328583 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Efficient algorithms for interval graphs and circular-arc graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Processor optimization for flow graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The NP-completeness column: an ongoing guide / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4142699 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Scheduling Interval-Ordered Tasks / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a property of the class of n-colorable graphs / rank | |||
Normal rank |
Latest revision as of 11:17, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Restrictions of graph partition problems. I |
scientific article |
Statements
Restrictions of graph partition problems. I (English)
0 references
28 February 1997
0 references
job-assignment problem
0 references