Generating hard and diverse test sets for NP-hard graph problems (Q1805463): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4773298 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4099676 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An introduction to the analysis of approximation algorithms / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A test problem generator for the Steiner problem in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the complexity of test case generation for NP-hard problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Maximum number of edges in connected graphs with a given domination number / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4871064 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4763341 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the theory of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5509541 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:31, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Generating hard and diverse test sets for NP-hard graph problems |
scientific article |
Statements
Generating hard and diverse test sets for NP-hard graph problems (English)
0 references
17 May 1995
0 references
NP-hard problems
0 references