Complexity of stability (Q2237893): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Domination alteration sets in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of unfrozen problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398864 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3852212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding Optimal Solutions With Neighborly Help. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Minimal Uncolorability is ${\text{D}}^{\text{p}} $-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing Boolean connectives of characteristic functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean Hierarchy and the Polynomial Hierarchy: A Closer Connection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural properties of edge-chromatic critical multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination critical and stable graphs upon edge removal / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3284375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Role colouring a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Stability. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs whose vertex independence number is unaffected by single edge addition or deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Anticritical graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal graphs domination insensitive to the removal of \(k\) edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: The strong exponential hierarchy collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact analysis of Dodgson elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of online manipulation of sequential elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of Kemeny elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total domination stability in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3526040 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graph coloring algorithm for large scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining computational complexity from characteristic ‘phase transitions’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets resolved / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of facets (and some facets of complexity) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact complexity of exact-four-colorability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact complexity of the winner problem for Young elections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472458 / rank
 
Normal rank
Property / cites work
 
Property / cites work: More complicated questions about maxima and minima, and some closures of NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Query Classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Core Stability in Hedonic Coalition Formation / rank
 
Normal rank

Latest revision as of 23:32, 26 July 2024

scientific article
Language Label Description Also known as
English
Complexity of stability
scientific article

    Statements

    Complexity of stability (English)
    0 references
    0 references
    0 references
    0 references
    28 October 2021
    0 references
    0 references
    stability
    0 references
    colorability
    0 references
    vertex cover
    0 references
    satisfiability
    0 references
    difference polynomial time
    0 references
    parallel access to NP
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references