Browse State-of-the-Art › Tree Decomposition

Tree Decomposition

3 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28

Graphs

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.

Description from the archive archive 2025-07-28.

Benchmarks archive 2025-07-28

No benchmark for this task in the archive.

Libraries

Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.

Datasets archive 2025-07-28

No dataset record in the archive lists this task.

Subtasks archive 2025-07-28

No subtask under this task in the archive's task tree.

Papers archive 2025-07-28

archive papers tagged: 34 · with a code link: 3 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran: none of the 34 tagged papers has a Syntology run on record

Page 1 of 1: papers 1 to 34 of 34, in archive order: by repositories listed in the archive (most first), then newest first, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers that list no repository come after every paper that lists one.

Papers without a page here are shown as plain text. A Syntology line reads “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the figure “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code); hover it for the repositories the samples that ran came from. The first sentence of the abstract is shown for the first 30 papers; every abstract is on its paper's page.

  • 25 Aug 2021 1 repository listed
    Nevertheless, iterative propagation restricts the information of higher-layer neighborhoods to be transported through and fused with the lower-layer neighborhoods', which unavoidably results in feature smoothing between…
  • 20 Aug 2020 1 repository listed
    We propose a unifying dynamic-programming framework to compute exact literal-weighted model counts of formulas in conjunctive normal form.
  • 1 Dec 2019 1 repository listed
    It is achieved by repeating the constraint-based causal structure learning scheme, iteratively, while searching for separating sets that are consistent with the graph obtained at the previous iteration.
  • HCAF-DTA: drug-target binding affinity prediction with cross-attention fused hypergraph neural networks
    2 Apr 2025 0 repositories listed
    Accurate prediction of the binding affinity between drugs and target proteins is a core task in computer-aided drug design.
  • Graph Inference with Effective Resistance Queries
    25 Feb 2025 0 repositories listed
    The goal of graph inference is to design algorithms for learning properties of a hidden graph using queries to an oracle that returns information about the graph.
  • A Hybrid Technique for Plant Disease Identification and Localisation in Real-time
    27 Dec 2024 0 repositories listed
    Over the past decade, several image-processing methods and algorithms have been proposed for identifying plant diseases based on visual data.
  • Bounds on the Treewidth of Level-k Rooted Phylogenetic Networks
    20 Nov 2024 0 repositories listed
    Phylogenetic networks are directed acyclic graphs that depict the genomic evolution of related taxa.
  • Improving Complex Reasoning over Knowledge Graph with Logic-Aware Curriculum Tuning
    2 May 2024 0 repositories listed
    Answering complex queries over incomplete knowledge graphs (KGs) is a challenging job.
  • Lifting uniform learners via distributional decomposition
    27 Mar 2023 0 repositories listed
    We show how any PAC learning algorithm that works under the uniform distribution can be transformed, in a blackbox fashion, into one that works under an arbitrary and unknown distribution 𝒟.
  • Calibrated Nonparametric Scan Statistics for Anomalous Pattern Detection in Graphs
    26 Jun 2022 0 repositories listed
    We propose a new approach, the calibrated nonparametric scan statistic (CNSS), for more accurate detection of anomalous patterns in large-scale, real-world graphs.
  • Practical Fixed-Parameter Algorithms for Defending Active Directory Style Attack Graphs
    25 Dec 2021 0 repositories listed
    Active Directory is the default security management system for Windows domain networks.
  • Latent Tree Decomposition Parsers for AMR-to-Text Generation
    27 Aug 2021 0 repositories listed
    Graph encoders in AMR-to-text generation models often rely on neighborhood convolutions or global vertex attention.
  • Computing the Newton-step faster than Hessian accumulation
    2 Aug 2021 0 repositories listed
    Computing the Newton-step of a generic function with N decision variables takes O(N³) flops.
  • TD-GEN: Graph Generation With Tree Decomposition
    20 Jun 2021 0 repositories listed
    We propose TD-GEN, a graph generation framework based on tree decomposition, and introduce a reduced upper bound on the maximum number of decisions needed for graph generation.
  • A Framework For Differentiable Discovery Of Graph Algorithms
    1 Jan 2021 0 repositories listed
    Recently there is a surge of interests in using graph neural networks (GNNs) to learn algorithms.
  • Learning Elimination Ordering for Tree Decomposition Problem
    17 Oct 2020 0 repositories listed
    We propose a Reinforcement Learning-based approach to approximately solve the Tree Decomposition problem.
  • A New Approach for Texture based Script Identification At Block Level using Quad Tree Decomposition
    16 Sep 2020 0 repositories listed
    A considerable amount of success has been achieved in developing monolingual OCR systems for Indic scripts.
  • Mixtape: Breaking the Softmax Bottleneck Efficiently
    1 Dec 2019 0 repositories listed
    The softmax bottleneck has been shown to limit the expressiveness of neural language models.
  • Graph Convolutional Policy for Solving Tree Decomposition via Reinforcement Learning Heuristics
    18 Oct 2019 0 repositories listed
    We propose a Reinforcement Learning based approach to approximately solve the Tree Decomposition (TD) problem.
  • Ordered Tree Decomposition for HRG Rule Extraction
    1 Jun 2019 0 repositories listed
    We present algorithms for extracting Hyperedge Replacement Grammar (HRG) rules from a graph along with a vertex order.
  • Sparse residual tree and forest
    18 Feb 2019 0 repositories listed
    Sparse residual tree (SRT) is an adaptive exploration method for multivariate scattered data approximation.
  • Optimizing Answer Set Computation via Heuristic-Based Decomposition
    23 Dec 2018 0 repositories listed
    Answer Set Programming (ASP) is a purely declarative formalism developed in the field of logic programming and nonmonotonic reasoning: computational problems are encoded by logic programs whose answer sets…
  • Image Segmentation Based on Multiscale Fast Spectral Clustering
    12 Dec 2018 0 repositories listed
    In recent years, spectral clustering has become one of the most popular clustering algorithms for image segmentation.
  • Cache Transition Systems for Graph Parsing
    1 Mar 2018 0 repositories listed
    Motivated by the task of semantic parsing, we describe a transition system that generalizes standard transition-based dependency parsing techniques to generate a graph rather than a tree.
  • Bayesian Learning of Clique Tree Structure
    23 Aug 2017 0 repositories listed
    The problem of categorical data analysis in high dimensions is considered.
  • Inference in Sparse Graphs with Pairwise Measurements and Side Information
    8 Mar 2017 0 repositories listed
    We consider the statistical problem of recovering a hidden "ground truth" binary labeling for the vertices of a graph up to low Hamming error from noisy edge and vertex measurements.
  • Image Analysis Using a Dual-Tree M-Band Wavelet Transform
    27 Feb 2017 0 repositories listed
    We propose a 2D generalization to the M-band case of the dual-tree decomposition structure (initially proposed by N.
  • A Hierarchical Spectral Method for Extreme Classification
    10 Nov 2015 0 repositories listed
    Extreme classification problems are multiclass and multilabel classification problems where the number of outputs is so large that straightforward strategies are neither statistically nor computationally viable.
  • Clustering Tree-structured Data on Manifold
    20 Jul 2015 0 repositories listed
    Tree-structured data usually contain both topological and geometrical information, and are necessarily considered on manifold instead of Euclidean space for appropriate data parameterization and analysis.
  • iTreePack: Protein Complex Side-Chain Packing by Dual Decomposition
    21 Apr 2015 0 repositories listed
    Protein side-chain packing is a critical component in obtaining the 3D coordinates of a structure and drug discovery.
  • Multiscale Dictionary Learning for Estimating Conditional Distributions
    4 Dec 2013 0 repositories listed
  • Bethe-ADMM for Tree Decomposition based Parallel MAP Inference
    26 Sep 2013 0 repositories listed
  • Minimum Error Tree Decomposition
    27 Mar 2013 0 repositories listed
  • Density Propagation and Improved Bounds on the Partition Function
    1 Dec 2012 0 repositories listed

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections