On independent cliques and linear complementarity problems (Q2095085): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2901948879 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1811.09798 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a polynomial fractional formulation for independence number of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast branching algorithm for cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public goods in networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum independent union of cliques problem: complexity and exact approaches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with unique maximum independent sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: An LPCC approach to nonconvex quadratic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On linear programs with linear complementarity constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the variational equilibrium as a refinement of the generalized Nash equilibrium / rank
 
Normal rank
Property / cites work
 
Property / cites work: The combinatorics of pivoting for the maximum weight clique. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complementary Pivoting Approach to the Maximum Weight Clique Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maxima for Graphs and a New Proof of a Theorem of Turán / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Refinement of the equilibrium of public goods games over networks: efficiency and effort of specialized equilibria / rank
 
Normal rank
Property / cites work
 
Property / cites work: On unique independent sets in graphs / rank
 
Normal rank

Latest revision as of 18:18, 30 July 2024

scientific article
Language Label Description Also known as
English
On independent cliques and linear complementarity problems
scientific article

    Statements

    On independent cliques and linear complementarity problems (English)
    0 references
    0 references
    0 references
    9 November 2022
    0 references
    linear complementarity problems
    0 references
    independent sets
    0 references
    dominating sets
    0 references
    cliques
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references