Pages that link to "Item:Q1751087"
From MaRDI portal
The following pages link to Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087):
Displaying 17 items.
- Treewidth and pathwidth parameterized by the vertex cover number (Q344839) (← links)
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← links)
- Graph reconstruction in the congested clique (Q2186818) (← links)
- The use of a pruned modular decomposition for \textsc{maximum matching} algorithms on some graph classes (Q2659073) (← links)
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
- On structural parameterizations of Node Kayles (Q2695476) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- Parameterized Algorithms for Parity Games (Q2946404) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q2946427) (← links)
- (Q3188893) (redirect page) (← links)
- Maximum Minimal Vertex Cover Parameterized by Vertex Cover (Q4588848) (← links)
- Iterated Type Partitions (Q5041190) (← links)
- Independent set reconfiguration parameterized by modular-width (Q5918925) (← links)
- (Q6089669) (← links)
- Parameterized complexity for iterated type partitions and modular-width (Q6126724) (← links)
