The following pages link to Kernels in planar digraphs (Q2485283):
Displaying 11 items.
- Finding kernels or solving SAT (Q414435) (← links)
- Subexponential parameterized algorithms (Q458457) (← links)
- Almost all digraphs have a kernel (Q915737) (← links)
- Linearity of grid minors in treewidth with applications through bidimensionality (Q949776) (← links)
- Algorithmic graph minor theory: Improved grid minor bounds and Wagner's contraction (Q1022348) (← links)
- Kernels in digraphs with covering number at most 3 (Q1861206) (← links)
- Partitioning vertices into in- and out-dominating sets in digraphs (Q2197403) (← links)
- Kernels in weighted digraphs (Q2454043) (← links)
- Parameterized complexity: the main ideas and connections to practical computing (Q2841253) (← links)
- (Q5327081) (← links)
- Counting kernels in directed graphs with arbitrary orientations (Q6559392) (← links)
