Image de couverture de livre

Is Graph Local Complementation Inherently Sequential?

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Concha-Vega, Pablo
Format:	Preprint
Publié:	2025
Sujets:	Computational Complexity Discrete Mathematics
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Local Homophily on Bicolored Graphs is $\mathbf{P}$-complete
par: Concha-Vega, Pablo
Publié: (2026)

Complexity of the Freezing Majority Rule with L-shaped Neighborhoods
par: Concha-Vega, Pablo, et autres
Publié: (2025)

Maximum Reachability Orientation of Mixed Graphs
par: Hörsch, Florian
Publié: (2025)

Counting Subgraphs in Somewhere Dense Graphs
par: Bressan, Marco, et autres
Publié: (2022)

Three Hardness Results for Graph Similarity Problems
par: Sun, He, et autres
Publié: (2023)

An Algorithm for Monitoring Edge-geodetic Sets in Chordal Graphs
par: Marcille, Clara, et autres
Publié: (2026)

$m$-Eternal Dominating Set Problem on Subclasses of Chordal Graphs
par: Rai, Ashutosh, et autres
Publié: (2026)

Graphs without a partition into two proportionally dense subgraphs
par: Bazgan, Cristina, et autres
Publié: (2018)

Reconfiguring Graph Homomorphisms on the Sphere
par: Lee, Jae-Baek, et autres
Publié: (2018)

Graph Irregularity via Edge Deletions
par: Bensmail, Julien, et autres
Publié: (2025)

Complexity Aspects of Homomorphisms of Ordered Graphs
par: Čertík, Michal, et autres
Publié: (2025)

On Computational Aspects of Cores of Ordered Graphs
par: Čertík, Michal, et autres
Publié: (2025)

Determining the Outerthickness of Graphs Is NP-Hard
par: Lee, Pin-Hsian, et autres
Publié: (2026)

The Interplay Between Domination and Separation in Graphs
par: Chakraborty, Dipayan, et autres
Publié: (2026)

Testing Isomorphism of Graphs in Polynomial Time
par: Xue, Rui
Publié: (2023)

Sparse High Dimensional Expanders via Local Lifts
par: Yaacov, Inbar Ben, et autres
Publié: (2024)

Finding d-Cuts in Claw-free Graphs
par: Ahn, Jungho, et autres
Publié: (2025)

Finding Minimum Matching Cuts in $H$-free Graphs
par: Lucke, Felicia, et autres
Publié: (2025)

Matching Cut and Variants on Bipartite Graphs of Bounded Radius and Diameter
par: Lucke, Felicia
Publié: (2025)

Algorithmic methods of finite discrete structures. Graph clique problem
par: Kurapov, Sergey, et autres
Publié: (2024)

On Closure Properties of Read-Once Oblivious Algebraic Branching Programs
par: Armand, Jules, et autres
Publié: (2025)

Monotone Bounded-Depth Complexity of Homomorphism Polynomials
par: Bhargav, C. S., et autres
Publié: (2025)

How to Reconfigure Your Alliances
par: Fernau, Henning, et autres
Publié: (2025)

List Decoding Quotient Reed-Muller Codes
par: Gotlib, Omri, et autres
Publié: (2025)

Property Testing in Bounded Degree Hypergraphs
par: Aaronson, Hugo, et autres
Publié: (2025)

On the Incompressibility of Truth With Application to Circuit Complexity
par: Tonon, Luke
Publié: (2025)

A Courcelle-Type Metatheorem for Rank-Bounded Unconstrained Binary Optimization
par: Harary, Marc
Publié: (2025)

On the complexity of freezing automata networks of bounded pathwidth
par: Goles, Eric, et autres
Publié: (2025)

Enumeration With Nice Roman Domination Properties
par: Mann, Kevin
Publié: (2025)

The PPP-completeness of the Ward-Szabo theorem
par: Ishizuka, Takashi
Publié: (2025)

A Distance Amplification Lemma for Monotonicity
par: Minzer, Dor
Publié: (2025)

Parameterized Complexity of Segment Routing
par: Bazgan, Cristina, et autres
Publié: (2025)

On the enumeration of Tarski fixed points
par: Müller, Julian
Publié: (2023)

Edge-Disjoint Paths in Eulerian Digraphs
par: Cavallaro, Dario, et autres
Publié: (2024)

Relations between monotone complexity measures based on decision tree complexity
par: Byramji, Farzan, et autres
Publié: (2024)

Gap Preserving Reductions Between Reconfiguration Problems
par: Ohsaka, Naoto
Publié: (2022)

Computational complexity of the Weisfeiler-Leman dimension
par: Lichter, Moritz, et autres
Publié: (2024)

Gap Amplification for Reconfiguration Problems
par: Ohsaka, Naoto
Publié: (2023)

Enumerating Minimal Defensive Alliances
par: Feng, Zhidan, et autres
Publié: (2023)

Infinitely growing configurations in Emil Post's tag system problem
par: Kurilenko, Nikita V.
Publié: (2021)