Pages that link to "Item:Q2849343"
From MaRDI portal
The following pages link to Kernelization Using Structural Parameters on Sparse Graph Classes (Q2849343):
Displaying 19 items.
- Propagation kernels: efficient graph kernels from propagated information (Q298353) (← links)
- Low rank estimation of smooth kernels on graphs (Q355091) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- Solving problems on graphs of high rank-width (Q1709595) (← links)
- Structural sparsity of complex networks: bounded expansion in random models and real-world graphs (Q2316938) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- Fixed-parameter tractable distances to sparse graph classes (Q2408199) (← links)
- Linear kernels for outbranching problems in sparse digraphs (Q2408200) (← links)
- On the Power of Simple Reductions for the Maximum Independent Set Problem (Q2817877) (← links)
- Minimum fill-in of sparse graphs: kernelization and approximation (Q2911621) (← links)
- Finite Integer Index of Pathwidth and Treewidth (Q2946024) (← links)
- Uniform Kernelization Complexity of Hitting Forbidden Minors (Q3448821) (← links)
- Solving Problems on Graphs of High Rank-Width (Q3449829) (← links)
- (Q5090497) (← links)
- (Q5111296) (← links)
- (Q5363775) (← links)
- A distributed low tree-depth decomposition algorithm for bounded expansion classes (Q5964897) (← links)
- Deep kernel supervised hashing for node classification in structural networks (Q6092010) (← links)
