Finding an Unknown Acyclic Orientation of a Given Graph (Q3557528): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Parallelism in Comparison Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Effect of Number of Hamiltonian Paths on the Complexity of a Vertex-Coloring Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4057549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tournament Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some optimal inapproximability results / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Sorting with Constant Time for Comparisons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting in one round / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant time parallel sorting: An empirical view. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching for acyclic orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gadgets, Approximation, and Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results in minimum-comparison sorting / rank
 
Normal rank

Latest revision as of 17:52, 2 July 2024

scientific article
Language Label Description Also known as
English
Finding an Unknown Acyclic Orientation of a Given Graph
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references