Cover Image

Independent Set Enumeration in King Graphs by Tensor Network Contractions

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Liang, Kai
Format:	Preprint
Published:	2025
Subjects:	Combinatorics Discrete Mathematics 05C30 (Primary), 68R05 (Secondary) G.2.2; F.2.2
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Independent Set Enumeration and Estimation of Related Constants of Grid Graphs and Their Variants
by: Liang, Kai
Published: (2025)

Completely independent spanning trees in the hypercube
by: Shaw, Benedict Randall
Published: (2024)

Counting Kernels in Directed Graphs with Arbitrary Orientations
by: Jartoux, Bruno
Published: (2022)

Lower Bounds for the Pfaffian Number of Graphs
by: Junchaya, Enrique, et al.
Published: (2026)

Directed Capacity-Preserving Subgraphs: Hardness and Exact Polynomial Algorithms
by: Chimani, Markus, et al.
Published: (2023)

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
by: Choi, Mujin, et al.
Published: (2025)

Monotone Arc Diagrams with few Biarcs
by: Chaplick, Steven, et al.
Published: (2024)

A note on the structure of locally finite planar quasi-transitive graphs
by: Giocanti, Ugo
Published: (2024)

Low Recourse Arborescence Forests Under Uniformly Random Arcs
by: Dahlmeier, J Niklas, et al.
Published: (2025)

The classification of minimally unsatisfiable 2-CNFs -- a fundamental study
by: Abbasizanjani, Hoda, et al.
Published: (2020)

How Local Separators Shape Community Structure in Large Networks
by: Frenkel, Sarah, et al.
Published: (2025)

Completely Independent Spanning Trees in Split Graphs: Structural Properties and Complexity
by: Lalou, Mohammed, et al.
Published: (2025)

Bounds on the Twin-Width of Product Graphs
by: Pettersson, William, et al.
Published: (2022)

Simple Approximations for General Spanner Problems
by: Bökler, Fritz, et al.
Published: (2025)

Exact Minimum Weight Spanners via Column Generation
by: Bökler, Fritz, et al.
Published: (2024)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
by: Chimani, Markus, et al.
Published: (2021)

Metrics on Permutation Families Defined by a Restriction Graph
by: Tymoshenko, Danylo, et al.
Published: (2025)

Conflict-Free Colouring of Subsets
by: Jartoux, Bruno, et al.
Published: (2022)

Almost Bipartite non-König-Egerváry Graphs Revisited
by: Levit, Vadim E., et al.
Published: (2024)

Temporalizing digraphs via linear-size balanced bi-trees
by: Bessy, Stéphane, et al.
Published: (2023)

Thick Forests
by: Dyer, Martin, et al.
Published: (2023)

A Systematic Approach to Crossing Numbers of Cartesian Products with Paths
by: Asiri, Zayed, et al.
Published: (2024)

Census Dual Graphs: Properties and Random Graph Models
by: Anderson, Sara, et al.
Published: (2026)

Tree-independence number VI. Thetas and pyramids
by: Chudnovsky, Maria, et al.
Published: (2025)

Catching Rats in $H$-minor-free Graphs
by: Gorsky, Maximilian, et al.
Published: (2025)

On the Number of Vertices/Edges whose Deletion Preserves the Konig-Egervary Property
by: Levit, Vadim E., et al.
Published: (2024)

On corona of Konig-Egervary graphs
by: Levit, Vadim E., et al.
Published: (2024)

Graph polynomials: some questions on the edge
by: Farr, Graham, et al.
Published: (2024)

On λ-backbone coloring of cliques with tree backbones in linear time
by: Michalik, Krzysztof, et al.
Published: (2021)

Local Equivalence Classes of Distance-Hereditary Graphs using Split Decompositions
by: Connolly, Nicholas, et al.
Published: (2026)

Boolean combinations of graphs
by: Adenwalla, Sarosh, et al.
Published: (2024)

Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
by: Komusiewicz, Christian, et al.
Published: (2023)

Efficient Preparation of Graph States using the Quotient-Augmented Strong Split Tree
by: Connolly, Nicholas, et al.
Published: (2026)

Graphs whose vertices of degree at least 2 lie in a triangle
by: Forte, Vinicius L. do, et al.
Published: (2022)

Exploration of $k$-edge-deficient temporal graphs in linear time
by: Lahtin, Ivan, et al.
Published: (2026)

Distance Critical Graphs
by: Cooper, Joshua, et al.
Published: (2024)

On Strict Brambles
by: Lardas, Emmanouil, et al.
Published: (2022)

Searching by Heterogeneous Agents
by: Dereniowski, Dariusz, et al.
Published: (2021)

Quickly excluding an annotated planar graph
by: Gorsky, Maximilian, et al.
Published: (2026)

The price of homogeneity is polynomial
by: Gorsky, Maximilian, et al.
Published: (2026)