Some simplified NP-complete graph problems (Q1230637): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: DBLP publication ID (P1635): journals/tcs/GareyJS76, #quickstatements; #temporary_batch_1731547958265
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Optimal Linear Ordering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation Graphs and Transitive Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133108 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for a maximum clique and a maximum independent set of a circle graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast algorithms for bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4066569 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/tcs/GareyJS76 / rank
 
Normal rank

Latest revision as of 02:43, 14 November 2024

scientific article
Language Label Description Also known as
English
Some simplified NP-complete graph problems
scientific article

    Statements

    Identifiers