首页/论文/1908.11034

arXiv 1908.110342019-08-29cs.DMcond-mat.str-elquant-ph

Carving-width and contraction trees for tensor networks

J. Jakes-Schauer, D. Anekstein, P. Wocjan

备注：: 16 pages, 7 figures, 1 table

英文摘要：

We study the problem of finding contraction orderings on tensor networks for physical simulations using a syncretic abstract data type, the $\textit{contraction-tree}$, and explain its connection to temporal and spatial measures of tensor contraction computational complexity (nodes express time; arcs express space). We have implemented the Ratcatcher of Seymour and Thomas for determining the carving-width of planar networks, in order to offer experimental evidence that this measure of spatial complexity makes a generally effective heuristic for limiting their total contraction time.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

欧拉图的良quis序：受限刻痕宽度

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width

Technische Universität Berlin（柏林工业大学）；National Institute of Informatics, Japan（日本国立情报学研究所）；The University of Tokyo, Japan（东京大学）

本文证明了具有受限刻痕宽度的欧拉图类在强浸入下是良quis序的，并提出了一种新的强浸入概念。同时指出无界度数的欧拉图类在强浸入下不满足良quis序，但弱浸入下可能满足。

2026-05-08cs.DMmath.CO

连接函数的分支宽度是固定参数可处理的

Branch-width of connectivity functions is fixed-parameter tractable

本文证明了连接函数的分支宽度问题在固定参数可处理范围内，并改进了相关算法的运行时间。

2026-02-09cs.DMcs.DSmath.CO

Clique-width and edge contraction

We prove that edge contractions do not preserve the property that a set of graphs has bounded clique-width. This property is preserved by contractions of edges, one end of which is a vertex of degree 2.

2013-10-21cs.DMcs.LO

Twin-width VI: the lens of contraction sequences

A contraction sequence of a graph consists of iteratively merging two of its vertices until only one vertex remains. The recently introduced twin-width graph invariant is based on contraction sequences. More precisely, if one puts red edges between two vertices representing non-homogeneous subsets, the twin-width is the minimum integer $d$ such that a contraction sequence keeps red degree at most $d$. By changing the condition imposed on the trigraphs (i.e., graphs with some edges being red) and possibly slightly tweaking the notion of contractions, we show how to characterize the well-establi…

2022-05-31cs.DMcs.DScs.LO

Games for width parameters and monotonicity

We introduce a search game for two players played on a "scenario" consisting of a ground set together with a collection of feasible partitions. This general setting allows us to obtain new characterisations of many width parameters such as rank-width and carving-width of graphs, matroid tree-width and GF(4)-rank-width. We show that the monotone game variant corresponds to a tree decomposition of the ground set along feasible partitions. Our framework also captures many other decompositions into "simple" subsets of the ground set, such as decompositions into planar subgraphs. Within our general…

2009-06-21cs.DMcs.GT

Twin-width III: Max Independent Set, Min Dominating Set, and Coloring

We recently introduced the graph invariant twin-width, and showed that first-order model checking can be solved in time $f(d,k)n$ for $n$-vertex graphs given with a witness that the twin-width is at most $d$, called $d$-contraction sequence or $d$-sequence, and formulas of size $k$ [Bonnet et al., FOCS '20]. The inevitable price to pay for such a general result is that $f$ is a tower of exponentials of height roughly $k$. In this paper, we show that algorithms based on twin-width need not be impractical. We present $2^{O(k)}n$-time algorithms for $k$-Independent Set, $r$-Scattered Set, $k$-Cli…

2021-02-12cs.CCcs.DMcs.DS

更多相关论文收起更多论文

Twin-width II: small classes

The twin-width of a graph $G$ is the minimum integer $d$ such that $G$ has a $d$-contraction sequence, that is, a sequence of $|V(G)|-1$ iterated vertex identifications for which the overall maximum number of red edges incident to a single vertex is at most $d$, where a red edge appears between two sets of identified vertices if they are not homogeneous in $G$. We show that if a graph admits a $d$-contraction sequence, then it also has a linear-arity tree of $f(d)$-contractions, for some function $f$. First this permits to show that every bounded twin-width class is small, i.e., has at most $n…

2020-06-17cs.DMcs.DScs.LO

孪生宽度为2的稀疏图具有有界树宽

Sparse Graphs of Twin-width 2 Have Bounded Tree-width

本文证明孪生宽度至多为2且不含大完全二部子图的稀疏图具有多项式有界树宽，并据此给出稀疏图类上判定孪生宽度是否超过2的多项式时间算法，同时说明该结果无法推广到孪生宽度3。

2023-07-04cs.DMcs.DSmath.CO

Lassos：沿同态推进树分解

Lassos: Pushing Tree Decompositions Forward Along Homomorphisms

本文证明在保持分解形状的前提下，收缩是使树宽单调的唯一满射同态类，并提出 lasso 概念，将结论推广到多种组合数据结构。

2025-06-10cs.DMmath.COmath.CT

Deciding twin-width at most 4 is NP-complete

We show that determining if an $n$-vertex graph has twin-width at most 4 is NP-complete, and requires time $2^{Ω(n/\log n)}$ unless the Exponential-Time Hypothesis fails. Along the way, we give an elementary proof that $n$-vertex graphs subdivided at least $2 \log n$ times have twin-width at most 4. We also show how to encode trigraphs $H$ (2-edge colored graphs involved in the definition of twin-width) into graphs $G$, in the sense that every $d$-sequence (sequence of vertex contractions witnessing that the twin-width is at most $d$) of $G$ inevitably creates $H$ as an induced subtrigraph, wh…

2021-12-16cs.CCcs.DMcs.DS

Are there any good digraph width measures?

Several different measures for digraph width have appeared in the last few years. However, none of them shares all the "nice" properties of treewidth: First, being \emph{algorithmically useful} i.e. admitting polynomial-time algorithms for all $\MS1$-definable problems on digraphs of bounded width. And, second, having nice \emph{structural properties} i.e. being monotone under taking subdigraphs and some form of arc contractions. As for the former, (undirected) $\MS1$ seems to be the least common denominator of all reasonably expressive logical languages on digraphs that can speak about the ed…

2010-04-09cs.DMcs.DS

GenTT：为通用张量置换生成向量化代码

GenTT: Generate Vectorized Codes for General Tensor Permutation

本文提出SIMD置换工具包GenTT，可针对任意指令集、位宽、张量形状和置换模式自动生成优化代码，在保持低复杂度的同时，相比Numpy实现最高38倍加速。

2025-06-04cs.DCcs.DMcs.DS

关于合并模型

On merge-models

Université Paris Cité（巴黎西岱大学）；CNRS, IRIF（法国国家科学研究中心，IRIF）；Centre d'Analyse et de Mathématique Sociales CNRS UMR 8557（法国国家科学研究中心UMR 8557分析与数学社会科学中心）；Southeast University（东南大学）；Computer Science Institute of Charles University (IUUK)（查理大学计算机科学研究所（IUUK））；University of Bremen（不来梅大学）

本文提出合并模型，作为双胞胎模型在合并宽度上的类比，用于表示二元关系结构，并展示双胞胎模型是合并模型的特例。

2026-04-08cs.DMcs.DScs.LO

不包含$K_{2,3}$诱导极小图的图可加误差地准等距于树宽至多为二的图

$K_{2,3}$-induced minor-free graphs admit quasi-isometry with additive distortion to graphs of tree-width at most two

School of Computer Science, University of Leeds（利兹大学计算机学院）

本文提出了一种在亚二次时间内计算普遍可签名图直径的算法，通过证明$K_{2,3}$-诱导极小图可加误差地准等距于树宽至多为二的图。

2026-08-13cs.DMmath.CO

对有标签图收缩参数化景观的更深入审视

A Finer View of the Parameterized Landscape of Labeled Graph Contractions

Indian Institute of Science Education and Research Bhopal（印度科学教育研究所博帕尔分校）；Indian Institute of Science Education and Research Pune（印度科学教育研究所浦那分校）

本文提出了一种构造性的固定参数算法，用于解决有标签图收缩问题，并证明其参数化复杂度下界，同时改进了相关算法并排除了子指数时间算法的存在。

2026-09-22cs.DMcs.DS

在具有稀疏符号树模型的图中快速计算最短路径及其应用

Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications

CNRS, ENS de Lyon, Université Claude Bernard Lyon 1（法国国家科学研究中心、里昂高等师范学院、里昂第一大学）；Discrete Mathematics Group, Institute for Basic Science (IBS)（基础科学研究院离散数学组）；School of Computing, KAIST（韩国科学技术院计算机学院）

本文提出了一种符号树模型，用于在具有稀疏符号树模型的图中快速计算最短路径，并应用于改进固定参数算法、APSP计算及矩阵乘法。

2026-02-18cs.DMcs.DSmath.CO