Pages that link to "Item:Q262249"
From MaRDI portal
The following pages link to Parameterized algorithms for finding square roots (Q262249):
Displaying 10 items.
- Finding cactus roots in polynomial time (Q726100) (← links)
- Maximizing the strong triadic closure in split graphs and proper interval graphs (Q2197407) (← links)
- A linear kernel for finding square roots of almost planar graphs (Q2402259) (← links)
- Computing square roots of graphs with low maximum degree (Q2413970) (← links)
- Finding Cactus Roots in Polynomial Time (Q2819519) (← links)
- (Q5136273) (← links)
- Strong triadic closure in cographs and graphs of low maximum degree (Q5915633) (← links)
- Finding cut-vertices in the square roots of a graph (Q5915963) (← links)
- Graph square roots of small distance from degree one graphs (Q5918752) (← links)
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2 (Q5920195) (← links)
