SOTAVerified

Tree Decomposition

Tree Decomposition is a technique in graph theory and computer science for representing a graph as a tree, where each node in the tree represents a set of vertices in the original graph. The goal of tree decomposition is to divide the graph into smaller, more manageable pieces, and to use the tree to represent the relationships between these pieces.

Papers

Recently AddedMost HypedMost ActiveNeeds VerificationMost Verified

Showing 1–10 of 34 papers

TitleStatusHype
HCAF-DTA: drug-target binding affinity prediction with cross-attention fused hypergraph neural networks—0
Graph Inference with Effective Resistance Queries—0
A Hybrid Technique for Plant Disease Identification and Localisation in Real-time—0
Bounds on the Treewidth of Level-k Rooted Phylogenetic Networks—0
Improving Complex Reasoning over Knowledge Graph with Logic-Aware Curriculum Tuning—0
Lifting uniform learners via distributional decomposition—0
Calibrated Nonparametric Scan Statistics for Anomalous Pattern Detection in Graphs—0
Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs—0
Latent Tree Decomposition Parsers for AMR-to-Text Generation—0
Tree Decomposed Graph Neural NetworkCode1
Show:102550
← PrevPage 1 of 4Next →

No leaderboard results yet.