AI Paper Atlas

Research map / Graph learning / Graph algorithms and clustering

Compiling Graph Substructures into Sentential Decision Diagrams

Masaaki Nishino, Norihito Yasuda, Shin-ichi Minato, Masaaki Nagata

AAAI 2017 · Graph learning › Graph algorithms and clustering · approach: Neural combinatorial optimization on graphs · 23 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
use ZSDD (vtree-based) instead of ZDD (right-linear) compilationtop-down graph substructure compilation · matchings, benchmark graphsdiagram size: 8,253,872 -> 103,317 on eil76Improved
use ZSDD instead of ZDDtop-down compilation · simple paths, benchmark graphsdiagram size: 991,456 -> 100,131 on att48Improved
top-down instead of bottom-up ZSDD constructionZSDD compilation · matchings, eil76compilation time (ms): 1,888 -> 143Improved
top-down ZSDD instead of SimPath ZDD (vtree order)compilation · matchings, eil76compilation time (ms): 11,019 -> 143Improved
top-down ZSDD instead of SimPath ZDD (vtree order)compilation · matchings, grafo10124.100compilation time (ms): 118 vs 385 (Z(v))Hurt
use vtree-induced variable order instead of BFS order for ZDD (ablation)SimPath ZDD · matchings, eil76diagram size: 8,253,872 -> 1,152,860Improved

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy