Image de couverture de livre

An improved upper bound measure of star complexity of graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Standish, Russell K.
Format:	Preprint
Publié:	2026
Sujets:	Computational Complexity 94A17, 05C30 G.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Minor Embedding in Broken Chimera and Pegasus Graphs is NP-complete
par: Lobe, Elisabeth, et autres
Publié: (2021)

Graph polynomials: some questions on the edge
par: Farr, Graham, et autres
Publié: (2024)

DAG Scheduling in the BSP Model
par: Papp, Pál András, et autres
Publié: (2023)

On the complexity of Sandwich Problems for $M$-partitions
par: Barsukov, Alexey, et autres
Publié: (2026)

Nearly Tight Lower Bounds for Relaxed Locally Decodable Codes via Robust Daisies
par: Goldberg, Guy, et autres
Publié: (2025)

Term Coding: An Entropic Framework for Extremal Combinatorics and the Guessing--Number Sandwich Theorem
par: Riis, Søren
Publié: (2026)

Label propagation on binomial random graphs
par: Kiwi, Marcos, et autres
Publié: (2023)

On the parameterized complexity of computing good edge-labelings
par: de Andrade, Davi, et autres
Publié: (2024)

On the number of Hamiltonian cycles in the generalized Petersen graph
par: Haugland, Jan Kristian
Publié: (2025)

Complexity of graph evolutions
par: Gao, Jeffrey, et autres
Publié: (2024)

On the Negation of a Hyperbolic-Valued Probability Distribution
par: Bory-Reyes, Juan, et autres
Publié: (2026)

Proper colorings of a graph in linear time using a number of colors linear in the maximum degree of the graph
par: Bhandari, Kritika, et autres
Publié: (2025)

Sphere packing proper colorings of an expander graph
par: Zhu, Honglin
Publié: (2024)

Term Coding and Dispersion: A Perfect-vs-Rate Complexity Dichotomy for Information Flow
par: Riis, Søren
Publié: (2026)

Lesche stability of the Shannon strong hyperbolic entropy and some hyperbolic extensions
par: Belman, Juan Adrián Ramírez, et autres
Publié: (2026)

XALP-completeness of Parameterized Problems on Planar Graphs
par: Bodlaender, Hans L., et autres
Publié: (2024)

On the number of spanning trees of bicirculant graphs
par: Yang, Jing, et autres
Publié: (2026)

Bounds on the genus for 2-cell embeddings of prefix-reversal graphs
par: Blanco, Saúl A., et autres
Publié: (2023)

The number of rooted spanning forests of bicirculant graphs
par: Yang, Jing, et autres
Publié: (2025)

Kernelization Dichotomies for Hitting Subgraphs under Structural Parameterizations
par: Bougeret, Marin, et autres
Publié: (2024)

Kernelization dichotomies for hitting minors under structural parameterizations
par: Bougeret, Marin, et autres
Publié: (2025)

How Does Machine Learning Manage Complexity?
par: Fortnow, Lance
Publié: (2026)

Graph Iterative Filtering methods for the analysis of nonstationary signals on graphs
par: Scarlato, Giuseppe, et autres
Publié: (2026)

An improved bound for 2-distance coloring of planar graphs with girth six
par: Deniz, Zakir
Publié: (2022)

Asymptotic Semantic Collapse in Hierarchical Optimization
par: Alpay, Faruk, et autres
Publié: (2026)

Submodular Benchmark Selection
par: Smola, Alexander
Publié: (2026)

A Proof of the Tree Packing Conjecture
par: Chalise, Parikshit, et autres
Publié: (2024)

Term Coding for Extremal Combinatorics: Dispersion and Complexity Dichotomies
par: Riis, Søren
Publié: (2025)

Dominic Welsh: his work and influence
par: Farr, Graham, et autres
Publié: (2024)

On roots of domination polynomials for friendship and book graphs
par: Rather, Bilal Ahmad
Publié: (2026)

Complexity of Firefighting on Graphs
par: Althoetmar, Julius, et autres
Publié: (2025)

Database for identifiability properties of linear compartmental models
par: Gogishvili, Natali
Publié: (2024)

A Fiber Criterion for Representation Identifiability in Supervised Learning
par: Sevetlidis, Vasileios
Publié: (2026)

Computational Complexity of Physical Counting
par: Simas, Tristan
Publié: (2026)

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

On the MST-ratio: Theoretical Bounds and Complexity of Finding the Maximum
par: Ameli, Afrouz Jabal, et autres
Publié: (2024)

On the spectral radius of unbalanced signed bipartite graphs
par: Conde, Cristian M., et autres
Publié: (2024)

Counting big Ramsey degrees of the homogeneous and universal $K_4$-free graph
par: Hubička, Jan, et autres
Publié: (2025)

Representing polynomial of ST-CONNECTIVITY
par: Iraids, Jānis, et autres
Publié: (2021)

Simultaneous recovery of a sparse topology and the admittance of an electrical network
par: Samperio, Álvaro
Publié: (2023)