Almost 2-SAT is fixed-parameter tractable (Q1034100): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2009.04.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1485150579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4500916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for the Feedback Vertex Set Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved exact algorithms for MAX-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Parameterized Algorithm for the Minimum Node Multiway Cut Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Approximability of the Disjoint Cycle Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: SOFSEM 2006: Theory and Practice of Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental and Efficient Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of finding subgraphs with hereditary properties. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterizing above Guaranteed Values: MaxSat and MaxCut / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized graph separation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:23, 2 July 2024

scientific article
Language Label Description Also known as
English
Almost 2-SAT is fixed-parameter tractable
scientific article

    Statements

    Almost 2-SAT is fixed-parameter tractable (English)
    0 references
    0 references
    0 references
    10 November 2009
    0 references
    0 references
    fixed-parameter algorithms
    0 references
    satisfiability problems
    0 references
    separation problems
    0 references
    0 references