XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure

Keyphrases

• Linear Structure 100%
• Parameterized Problems 100%
• Dominating Set 100%
• Capacitated 50%
• Natural Places 50%
• Path Length 50%
• Linear Mim-width 50%
• XP Algorithm 50%
• Odd Cycle Transversal 50%
• Linear Clique-width 50%
• MaxCut 50%
• Feedback Vertex Set 50%
• Width Measures 50%

Mathematics

• Linear Structure 100%
• Dominating Set 100%
• Independent Set 50%
• Transversals 50%
• Max-Cut 50%
• Clique-width 50%