Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT (Q2632009): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q128930596, #quickstatements; #temporary_batch_1724872475876
 
(2 intermediate revisions by 2 users not shown)
Property / arXiv ID
 
Property / arXiv ID: 1809.01998 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node listings for reducible flow graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Feedback Vertex Set Problem with Applications to Constraint Satisfaction and Bayesian Inference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex set on cocomparability graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interval digraphs: An analogue of interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3397627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum feedback sets and multicuts in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4125730 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizations of Reducible Flow Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex 2-coloring without monochromatic cycles of fixed size is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: A contraction algorithm for finding small cycle cutsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear-time algorithm for the weighted feedback vertex problem on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3090774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for deciding collectively rational consumption behavior / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring Graphs Using Two Colors While Avoiding Monochromatic Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust linear algorithms for cutsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing directed circuits fractionally / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Testing flow graph reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback vertex sets and cyclically reducible graphs / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128930596 / rank
 
Normal rank

Latest revision as of 23:49, 28 August 2024

scientific article
Language Label Description Also known as
English
Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT
scientific article

    Statements

    Min (a)cyclic feedback vertex sets and MIN ones monotone 3-SAT (English)
    0 references
    0 references
    17 May 2019
    0 references
    feedback vertex set
    0 references
    3-SAT
    0 references
    minimum ones 3-SAT
    0 references
    NP-completeness
    0 references
    flow reducible graphs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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