Elusiveness of Finding Degrees (Q2971652): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-53007-9_22 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2585078467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Scores in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete subgraphs are elusive / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfectness is an Elusive Graph Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the recognition of digraph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evasiveness of Graph Properties and Topological Fixed-Point Theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On recognizing graph properties from adjacency matrices / rank
 
Normal rank

Latest revision as of 15:22, 13 July 2024

scientific article
Language Label Description Also known as
English
Elusiveness of Finding Degrees
scientific article

    Statements

    Elusiveness of Finding Degrees (English)
    0 references
    0 references
    0 references
    0 references
    7 April 2017
    0 references
    elusiveness
    0 references
    \(k\)-degree
    0 references
    maximum degree
    0 references
    adversary arguments
    0 references

    Identifiers