arXiv (All)
open access
Taming Treewidth DP with Modulators: A General Booster for Graph Heuristics
Treewidth is a fundamental graph invariant that quantifies how tree-like a given graph is. It is extensively used with dynamic programming to design fixed-parameter tractable algorithms for many NP-hard graph combinatorial optimization problems. However, despite broad theoretical applicability, tree
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- A Faster Algorithm for Fewer Vertex-Disjoint Paths Parameterized by Treewidth#1077223
- Visualizing Treewidth#798636
- Visualizing Treewidth#797223
- FABO: Agent-Guided Discovery of Joint Breakpoint Optimization for Timing-Driven Routing Trees#799484
- FABO: Agent-Guided Discovery of Joint Breakpoint Optimization for Timing-Driven Routing Trees#798061
Record · ID 1117539
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive