„Graph kernel“
Suchergebnisse
389 Treffer
-
Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies
-
Maximum Edge-Colorable Subgraph and Strong Triadic Closure Parameterized by Distance to Low-Degree Graphs
-
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs
-
Kernelized Convolutional and Transformer Based Hierarchical Spatio-temporal Attention Network for Autonomous Vehicle Trajectory Prediction
-
A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs
-
Matching Cut: Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms
-
Dual Parameterization of Weighted Coloring
-
A Polynomial Kernel for Diamond-Free Editing
-
On the Maximum Colorful Arborescence Problem and Color Hierarchy Graph Structure
-
Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor
-
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials
-
Lossy Kernels for Hitting Subgraphs
-
The Power of Linear-Time Data Reduction for Maximum Matching
-
Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
-
Lossy Kernels for Graph Contraction Problems
-
Fractals for Kernelization Lower Bounds, With an Application to Length-Bounded Cut Problems
-
Graph Motif Problems Parameterized by Dual
-
Parameterized Algorithms for Deletion to (r,ell)-Graphs
-
A Polynomial Kernel for Block Graph Deletion
-
Linear Kernels for Outbranching Problems in Sparse Digraphs