Pages that link to "Item:Q2403795"
From MaRDI portal
The following pages link to The graph motif problem parameterized by the structure of the input graph (Q2403795):
Displaying 9 items.
- Simplified algorithmic metatheorems beyond MSO: treewidth and neighborhood diversity (Q1687933) (← links)
- The balanced connected subgraph problem for geometric intersection graphs (Q2166729) (← links)
- FPT and kernelization algorithms for the induced tree problem (Q2692722) (← links)
- Graph Motif Problems Parameterized by Dual (Q5119384) (← links)
- (Q5140739) (← links)
- Tight Bounds for Planar Strongly Connected Steiner Subgraph with Fixed Number of Terminals (and Extensions) (Q5221061) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- The balanced connected subgraph problem (Q5918764) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
