scientific article; zbMATH DE number 7559371
From MaRDI portal
Publication:5089157
DOI10.4230/LIPIcs.TQC.2019.10MaRDI QIDQ5089157
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1906.00013
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The treewidth of line graphs
- Tensor network contractions for \#SAT
- Derivation of algorithms for cutwidth and related graph layout parameters
- On embedding graphs in trees
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Graph minors. X: Obstructions to tree-decomposition
- Call routing and the ratcatcher
- Minimal congestion trees
- Tour Merging via Branch-Decomposition
- Simulating Quantum Computation by Contracting Tensor Networks
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Constructive linear time algorithms for branchwidth
- A linear time algorithm for finding tree-decompositions of small treewidth
- Quantum Computation and the Evaluation of Tensor Networks
- Parameterized Algorithms
This page was built for publication:
