Image de couverture de livre

An Enumerative Perspective on Connectivity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Akmal, Shyan
Format:	Preprint
Publié:	2023
Sujets:	Data Structures and Algorithms Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Graph Coloring Below Guarantees via Co-Triangle Packing
par: Akmal, Shyan, et autres
Publié: (2025)

Node-Weighted Triangles: Faster and Simpler
par: Akmal, Shyan, et autres
Publié: (2026)

A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection
par: Abboud, Amir, et autres
Publié: (2025)

Detecting Disjoint Shortest Paths in Linear Time and More
par: Akmal, Shyan, et autres
Publié: (2024)

Optimal Enumeration of Eulerian Trails in Directed Graphs
par: Bals, Ben, et autres
Publié: (2026)

Prime Factorization of the Kirchhoff Polynomial: Compact Enumeration of Arborescences
par: Mihalák, Matúš, et autres
Publié: (2015)

Output-Sensitive Enumeration of Potential Maximal Cliques in Polynomial Space
par: Brosse, Caroline, et autres
Publié: (2024)

Enumerating minimal solution sets for metric graph problems
par: Bergougnoux, Benjamin, et autres
Publié: (2023)

On the Enumeration of all Unique Paths of Recombining Trinomial Trees
par: Torres, Ethan, et autres
Publié: (2025)

Enumerating minimal dominating sets and variants in chordal bipartite graphs
par: Castelo, Emanuel, et autres
Publié: (2025)

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
par: Bonamy, Marthe, et autres
Publié: (2020)

Hypergraph Connectivity Augmentation in Strongly Polynomial Time
par: Bérczi, Kristóf, et autres
Publié: (2024)

Hypergraph Splitting-Off via Element-Connectivity Preserving Reductions
par: Chandrasekaran, Karthekeyan, et autres
Publié: (2025)

Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
par: German, Samuel
Publié: (2026)

A Parameterized Perspective on Uniquely Restricted Matchings
par: Chaudhary, Juhi, et autres
Publié: (2025)

Path Cover, Hamiltonicity, and Independence Number: An FPT Perspective
par: Fomin, Fedor V., et autres
Publié: (2024)

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
par: Deligkas, Argyrios, et autres
Publié: (2025)

Constructive Characterization and Recognition Algorithm for Grafts with a Connected Minimum Join
par: Kita, Nanano
Publié: (2025)

Enumeration of minimal transversals of hypergraphs of bounded VC-dimension
par: Mary, Arnaud
Publié: (2024)

Enumeration of Bases in Matroid with Exponentially Large Ground Set
par: Nishimura, Yuki, et autres
Publié: (2025)

Parameterized Complexity of Streaming Diameter and Connectivity Problems
par: Oostveen, Jelle J., et autres
Publié: (2022)

Max Weight Independent Set in sparse graphs with no long claws
par: Abrishami, Tara, et autres
Publié: (2023)

Revisiting Tree Isomorphism: An Algorithmic Bric-à-Brac
par: Ingels, Florian
Publié: (2023)

Solving the List Coloring Problem through a Branch-and-Price algorithm
par: Lucci, Mauro, et autres
Publié: (2023)

Continuous optimization methods for the graph isomorphism problem
par: Klus, Stefan, et autres
Publié: (2023)

Optimal Mixing via Tensorization for Random Independent Sets on Arbitrary Trees
par: Efthymiou, Charilaos, et autres
Publié: (2023)

Distance-Preserving Graph Compression Techniques
par: Madani, Amirali, et autres
Publié: (2023)

The Role of Dimension in the Online Chasing Problem
par: Papazov, Hristo
Publié: (2023)

Correcting matrix products over the ring of integers
par: Wu, Yu-Lun, et autres
Publié: (2023)

Theoretical analysis of git bisect
par: Courtiel, Julien, et autres
Publié: (2023)

Simultaneous Drawing of Layered Trees
par: Katheder, Julia, et autres
Publié: (2023)

Vital Edges for (s,t)-mincut: Efficient Algorithms, Compact Structures, and Optimal Sensitivity Oracle
par: Baswana, Surender, et autres
Publié: (2023)

Isomorphism for Tournaments of Small Twin Width
par: Grohe, Martin, et autres
Publié: (2023)

Triangle-free 2-matchings
par: Paluch, Katarzyna
Publié: (2023)

Simultaneously Approximating All $\ell_p$-norms in Correlation Clustering
par: Davies, Sami, et autres
Publié: (2023)

Splitting-off in Hypergraphs
par: Bérczi, Kristóf, et autres
Publié: (2023)

On the Relationship Between Several Variants of the Linear Hashing Conjecture
par: Westover, Alek
Publié: (2023)

Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness
par: Antony, Dhanyamol, et autres
Publié: (2023)

On the Polynomial Kernelizations of Finding a Shortest Path with Positive Disjunctive Constraints
par: Bandopadhyay, Susobhan, et autres
Publié: (2023)

String Matching with a Dynamic Pattern
par: Monteiro, Bruno, et autres
Publié: (2025)