Image de couverture de livre

Independent Set Enumeration and Estimation of Related Constants of Grid Graphs and Their Variants

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Liang, Kai
Format:	Preprint
Publié:	2025
Sujets:	Combinatorics 05C30 (Primary), 68R05 (Secondary) G.2.2; F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Independent Set Enumeration in King Graphs by Tensor Network Contractions
par: Liang, Kai
Publié: (2025)

Completely independent spanning trees in the hypercube
par: Shaw, Benedict Randall
Publié: (2024)

Counting Kernels in Directed Graphs with Arbitrary Orientations
par: Jartoux, Bruno
Publié: (2022)

On the Relation Between Treewidth, Tree-Independence Number, and Tree-Chromatic Number of Graphs
par: Koutsoutis, Alex, et autres
Publié: (2025)

Exact Algorithms for MaxCut on Split Graphs
par: Lalovic, Marko
Publié: (2024)

An efficient algorithm for identifying rainbow ortho-convex 4-sets in k-colored point sets
par: Flores-Peñaloza, David, et autres
Publié: (2024)

Lower Bounds for the Pfaffian Number of Graphs
par: Junchaya, Enrique, et autres
Publié: (2026)

Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
par: Morse, Gregory, et autres
Publié: (2026)

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
par: Choi, Mujin, et autres
Publié: (2025)

Directed Capacity-Preserving Subgraphs: Hardness and Exact Polynomial Algorithms
par: Chimani, Markus, et autres
Publié: (2023)

Low Recourse Arborescence Forests Under Uniformly Random Arcs
par: Dahlmeier, J Niklas, et autres
Publié: (2025)

Monotone Arc Diagrams with few Biarcs
par: Chaplick, Steven, et autres
Publié: (2024)

Slavic Techniques for Hat Guessing Algorithms
par: McInnis, I. M. J.
Publié: (2025)

Simple Approximations for General Spanner Problems
par: Bökler, Fritz, et autres
Publié: (2025)

Exact Minimum Weight Spanners via Column Generation
par: Bökler, Fritz, et autres
Publié: (2024)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
par: Chimani, Markus, et autres
Publié: (2021)

Metrics on Permutation Families Defined by a Restriction Graph
par: Tymoshenko, Danylo, et autres
Publié: (2025)

Shortest two disjoint paths in conservative graphs
par: Schlotter, Ildikó
Publié: (2023)

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

Identification to Subclasses of Chordal Graphs
par: Golovach, Petr A., et autres
Publié: (2026)

The classification of minimally unsatisfiable 2-CNFs -- a fundamental study
par: Abbasizanjani, Hoda, et autres
Publié: (2020)

How Local Separators Shape Community Structure in Large Networks
par: Frenkel, Sarah, et autres
Publié: (2025)

Model Checking for Low Monodimensionality Fragments of CMSO on Topological-Minor-Free Graph Classes
par: Sau, Ignasi, et autres
Publié: (2026)

On 1-Konig-Egervary Graphs
par: Levit, Vadim E., et autres
Publié: (2023)

Algorithm for Constructing Related Spanning Directed Forests of Minimum Weight
par: Buslov, Vasily
Publié: (2025)

Quickly excluding an annotated planar graph
par: Gorsky, Maximilian, et autres
Publié: (2026)

The price of homogeneity is polynomial
par: Gorsky, Maximilian, et autres
Publié: (2026)

Backbone coloring for graphs with degree 4
par: Michalik, Krzysztof, et autres
Publié: (2024)

A Constant-factor Approximation for Weighted Bond Cover
par: Kim, Eun Jung, et autres
Publié: (2021)

Traffic-Oblivious Multi-Commodity Flow Network Design
par: Chimani, Markus, et autres
Publié: (2025)

Completely Independent Spanning Trees in Split Graphs: Structural Properties and Complexity
par: Lalou, Mohammed, et autres
Publié: (2025)

Irregularity and Topological Indices in Fibonacci Word Trees and Modified Fibonacci Word Index
par: Hamoud, Jasem, et autres
Publié: (2025)

The Minimum Subgraph Complementation Problem
par: Gutiérrez, Juan, et autres
Publié: (2025)

Temporalizing digraphs via linear-size balanced bi-trees
par: Bessy, Stéphane, et autres
Publié: (2023)

Local Equivalence Classes of Distance-Hereditary Graphs using Split Decompositions
par: Connolly, Nicholas, et autres
Publié: (2026)

Efficient Preparation of Graph States using the Quotient-Augmented Strong Split Tree
par: Connolly, Nicholas, et autres
Publié: (2026)

On the twin-width of near-regular graphs
par: Heinrich, Irene, et autres
Publié: (2025)

Exploration of $k$-edge-deficient temporal graphs in linear time
par: Lahtin, Ivan, et autres
Publié: (2026)

Tree-independence number VI. Thetas and pyramids
par: Chudnovsky, Maria, et autres
Publié: (2025)

On the Diameter of Arrangements of Topological Disks
par: Abiad, Aida, et autres
Publié: (2025)