On distance-d independent set and other problems in graphs with “few” minimal separators

Keyphrases

• Minimal Separator 100%
• Distance-d Independent Set 100%
• Feedback Vertex Set 50%
• Graph Classification 50%
• Polynomial Time 25%
• NP-hard 25%
• Domination Problems 25%
• Connected Vertex Cover 25%
• Pairwise Distance 25%
• Maximum Independent Set 25%
• Two-directional 25%
• Circular-arc Graphs 25%
• Maximum Induced Subgraphs 25%
• Power of a Graph 25%
• Polynomial-time Algorithm 25%
• Independent Domination 25%
• Chordal Graph 25%

INIS

• graphs 100%
• distance 100%
• polynomials 66%
• feedback 33%
• algorithms 16%
• power 16%

Mathematics

• Polynomial 100%
• Independent Set 100%
• Polynomial Time 33%
• Induced Subgraph 33%
• Pairwise Distance 33%
• Maximum Independent Set 33%