Complexity of finding maximum regular induced subgraphs with prescribed degree (Q401302): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexity of Finding Maximum Regular Induced Subgraphs with Prescribed Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree decompositions of graphs: saving memory in dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4288578 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Classes: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum \(k\)-regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385531 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: Maximum $r$-Regular Induced Subgraph Problem: Fast Exponential Algorithms and Combinatorial Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong lower bounds on the approximability of some NPO PB-complete maximization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic meta-theorems for restrictions of treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum regular induced subgraphs in \(2P_3\)-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximation of maximum subgraph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving an upper bound on the size of \(k\)-regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of finding regular induced subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability results for the maximum and minimum maximal induced matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding whether a planar graph has a cubic subgraph is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding regular subgraphs in both arbitrary and planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On locating cubic subgraphs in bounded-degree connected bipartite graphs / rank
 
Normal rank

Latest revision as of 22:14, 8 July 2024

scientific article
Language Label Description Also known as
English
Complexity of finding maximum regular induced subgraphs with prescribed degree
scientific article

    Statements

    Complexity of finding maximum regular induced subgraphs with prescribed degree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 August 2014
    0 references
    bipartite graph
    0 references
    chordal graph
    0 references
    graph algorithm
    0 references
    inapproximability
    0 references
    planar graph
    0 references
    regular induced subgraph
    0 references
    treewidth
    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
    0 references