Algorithms for finding maximum transitive subtournaments (Q5963652): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On the capacity of digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5480635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique-detection models in computational biochemistry and genomics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting search with variable elimination in constraint optimization and constraint satisfaction problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral approach to the feedback vertex set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Qualitative independence and Sperner problems for directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sperner capacity of small digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local chromatic number and Sperner capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3822754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating minimum feedback vertex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The dichromatic number of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Russian doll search for the Steiner triple covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orientations of self-complementary graphs and the relation of Sperner and Shannon capacities / rank
 
Normal rank

Latest revision as of 11:02, 11 July 2024

scientific article; zbMATH DE number 6544340
Language Label Description Also known as
English
Algorithms for finding maximum transitive subtournaments
scientific article; zbMATH DE number 6544340

    Statements

    Algorithms for finding maximum transitive subtournaments (English)
    0 references
    0 references
    0 references
    23 February 2016
    0 references
    backtrack search
    0 references
    clique
    0 references
    directed acyclic graph
    0 references
    feedback vertex set
    0 references
    Russian doll search
    0 references
    transitive tournament
    0 references

    Identifiers