Optimization problems in multiple subtree graphs (Q531599): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3221758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4829009 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Split Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: KKM -- a topological approach for trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Sets in Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934605 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intersection graphs of subtrees in trees are exactly the chordal graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal Values of the Interval Number of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient bounds for the stable set, vertex cover and set packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path hitting in acyclic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognizing graphs with fixed interval number is NP-complete / rank
 
Normal rank

Latest revision as of 00:15, 4 July 2024

scientific article
Language Label Description Also known as
English
Optimization problems in multiple subtree graphs
scientific article

    Statements

    Optimization problems in multiple subtree graphs (English)
    0 references
    0 references
    0 references
    19 April 2011
    0 references
    approximation algorithms
    0 references
    minimum dominating set
    0 references
    maximum independent set
    0 references
    minimum coloring
    0 references
    minimum vertex cover
    0 references
    maximum clique
    0 references
    multiple subtree graphs
    0 references

    Identifiers