Pages that link to "Item:Q3113765"

The following pages link to Finding Induced Subgraphs via Minimal Triangulations (Q3113765):

Displaying 3 items.

• Largest chordal and interval subgraphs faster than \(2^n\) (Q329301) (← links)
• Enumerating minimal subset feedback vertex sets (Q472481) (← links)
• Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)