Imagen de Portada

Temporal Cycle Detection and Acyclic Temporization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	de Andrade, Davi, Araújo, Júlio, Ibiapina, Allen, Marino, Andrea, Schoeters, Jason, Silva, Ana
Formato:	Preprint
Publicado:	2025
Materias:	Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Matching and Edge Cover in Temporal Graphs
por: Cioni, Lapo, et al.
Publicado: (2025)

Vector TSP: A Traveling Salesperson Problem with Racetrack-like Acceleration Constraints
por: Casteigts, Arnaud, et al.
Publicado: (2020)

A near-optimal Quadratic Goldreich-Levin algorithm
por: Briët, Jop, et al.
Publicado: (2025)

Recognizing and Realizing Temporal Reachability Graphs
por: Erlebach, Thomas, et al.
Publicado: (2025)

On the parameterized complexity of computing good edge-labelings
por: de Andrade, Davi, et al.
Publicado: (2024)

Menger's Theorem for Temporal Paths (Not Walks)
por: Ibiapina, Allen, et al.
Publicado: (2022)

On the Hardness of Finding Temporally Connected Subgraphs of Any Size
por: Casteigts, Arnaud, et al.
Publicado: (2026)

Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs
por: Casteigts, Arnaud, et al.
Publicado: (2024)

Structural Parameterizations for Induced and Acyclic Matching
por: Lampis, Michael, et al.
Publicado: (2025)

Temporal Team Semantics Revisited
por: Gutsfeld, Jens Oliver, et al.
Publicado: (2021)

Breaking the Temporal Complexity Barrier: Bucket Calculus for Parallel Machine Scheduling
por: Mohammad, Noor Islam S.
Publicado: (2026)

A universal bound on the space complexity of Directed Acyclic Graph computations
por: Bilardi, Gianfranco, et al.
Publicado: (2024)

Symmetric quantum computation
por: Castro-Silva, Davi, et al.
Publicado: (2025)

Parameterized Restless Temporal Path
por: Cauvi, Justine, et al.
Publicado: (2025)

Detection of the Important Control Nodes in Network Controllability Processes on Temporal Networks Using Temporal Graph Transformer Neural Networks
por: Zewen Qiu, et al.
Publicado: (2026)

Maximizing Minimum Cycle Bases Intersection
por: Watel, Dimitri, et al.
Publicado: (2024)

Novel Complexity Results for Temporal Separators with Deadlines
por: Dondi, Riccardo, et al.
Publicado: (2025)

The Complexity of Contracting Bipartite Graphs into Small Cycles
por: Krithika, R., et al.
Publicado: (2022)

Temporal Reachability Dominating Sets: contagion in temporal graphs
por: Kutner, David C., et al.
Publicado: (2023)

Robust Controllability Network Method on Temporal Network Using Temporal Link Prediction and Network Embedding
por: Yan Dou, et al.
Publicado: (2025)

Multiwinner Temporal Voting with Aversion to Change
por: Zech, Valentin, et al.
Publicado: (2024)

Complexity Classification of Complex-Weighted Counting Acyclic Constraint Satisfaction Problems
por: Yamakami, Tomoyuki
Publicado: (2024)

New results in canonical polyadic decomposition over finite fields
por: Yang, Jason
Publicado: (2025)

Faster search for tensor decomposition over finite fields
por: Yang, Jason
Publicado: (2025)

Ruling Out Low-rank Matrix Multiplication Tensor Decompositions with Symmetries via SAT
por: Yang, Jason
Publicado: (2024)

Low-Rank Tensor Decomposition over Finite Fields
por: Yang, Jason
Publicado: (2024)

Depth-first search for tensor rank and border rank over finite fields
por: Yang, Jason
Publicado: (2024)

Fixed-parameter tractability of canonical polyadic decomposition over finite fields
por: Yang, Jason
Publicado: (2024)

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
por: Herrmann, Anton, et al.
Publicado: (2025)

The Complexity of Transitively Orienting Temporal Graphs
por: Mertzios, George B., et al.
Publicado: (2021)

MaxMin Separation Problems: FPT Algorithms for $st$-Separator and Odd Cycle Transversal
por: Gaikwad, Ajinkya, et al.
Publicado: (2025)

Analysis of Violence Patterns in Mexico: A Complex Temporal Networks Approach
por: Edwin Montes-Orozco, et al.
Publicado: (2025)

ACO‐Based Neural Network to Enhance the Efficiency of Network Controllability of Temporal Networks
por: Jie Zhang, et al.
Publicado: (2025)

Minimum cost flow decomposition on arc-coloured networks
por: Neto, Claudio Carvalho, et al.
Publicado: (2025)

On complexity of restricted fragments of Decision DNNF
por: Calí, Andrea, et al.
Publicado: (2025)

Average-Case Hardness of Binary-Encoded Clique in Proof and Communication Complexity
por: de Rezende, Susanna F., et al.
Publicado: (2026)

Complexity Thresholds for the Constrained Colored Token Swapping Problem
por: Bilò, Davide, et al.
Publicado: (2026)

On the Dynamics of Bounded-Degree Automata Networks
por: Aracena, Julio, et al.
Publicado: (2025)

The Role of Regularity in (Hyper-)Clique Detection and Implications for Optimizing Boolean CSPs
por: Fischer, Nick, et al.
Publicado: (2025)

Worst-Case and Average-Case Hardness of Hypercycle and Database Problems
por: Fu, Cheng-Hao, et al.
Publicado: (2025)