Polar SAT and related graphs (Q2466002): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A linear-time algorithm for testing the truth of certain quantified Boolean formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination, independent domination, and duality in strongly chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly triangulated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385570 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satgraphs and independent domination. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492624 / rank
 
Normal rank

Revision as of 14:02, 27 June 2024

scientific article
Language Label Description Also known as
English
Polar SAT and related graphs
scientific article

    Statements

    Polar SAT and related graphs (English)
    0 references
    0 references
    0 references
    11 January 2008
    0 references
    satisfiability problem
    0 references
    polar SAT
    0 references
    satgraph
    0 references

    Identifiers

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