Image de couverture de livre

The Complexity of Transitively Orienting Temporal Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Mertzios, George B., Molter, Hendrik, Renken, Malte, Spirakis, Paul G., Zschoche, Philipp
Format:	Preprint
Publié:	2021
Sujets:	Data Structures and Algorithms 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

Temporal Graph Realization With Bounded Stretch
par: Mertzios, George B., et autres
Publié: (2025)

The Complexity of Temporal Vertex Cover in Small-Degree Graphs
par: Hamm, Thekla, et autres
Publié: (2022)

Microscopic Structure of Random 3-SAT: A Discrete Geometric Approach to Phase Transitions and Algorithmic Complexity
par: Zhan, Yongjian
Publié: (2026)

The Parameterized Complexity of Independent Set and More when Excluding a Half-Graph, Co-Matching, or Matching
par: Dreier, Jan, et autres
Publié: (2026)

Realizing temporal graphs from fastest travel times
par: Klobas, Nina, et autres
Publié: (2023)

The Complexity of Cluster Vertex Splitting and Company
par: Firbas, Alexander, et autres
Publié: (2023)

Colouring Graphs Without a Subdivided H-Graph: A Full Complexity Classification
par: Eagling-Vose, Tala, et autres
Publié: (2025)

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

The Parameterized Complexity of Vertex-Coloring Edge-Weighting
par: Aute, Shubhada, et autres
Publié: (2026)

Refining the Complexity Landscape of Speed Scaling: Hardness and Algorithms
par: Antoniadis, Antonios, et autres
Publié: (2025)

Randomized Communication and Implicit Graph Representations
par: Harms, Nathaniel, et autres
Publié: (2021)

A Dichotomy for Maximum PCSPs on Graphs
par: Nakajima, Tamio-Vesa, et autres
Publié: (2024)

On Stable Cutsets in General and Minimum Degree Constrained Graphs
par: Vroon, Mats, et autres
Publié: (2025)

Algorithmic Aspects of Temporal Betweenness
par: Buß, Sebastian, et autres
Publié: (2020)

A Polynomial Kernel for Face Cover on Non-Embedded Planar Graphs
par: Hamm, Thekla, et autres
Publié: (2026)

Combinatorial Parameterized Algorithms for Chemical Descriptors based on Molecular Graph Sparsity
par: Conrado, Giovanna K., et autres
Publié: (2023)

The Days On Days Off Scheduling Problem
par: Nießen, Fabien, et autres
Publié: (2024)

U-Bubble Model for Mixed Unit Interval Graphs and its Applications: The MaxCut Problem Revisited
par: Kratochvíl, Jan, et autres
Publié: (2020)

NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
par: Fairbairn, David L., et autres
Publié: (2024)

Finding d-Cuts in Graphs of Bounded Diameter, Graphs of Bounded Radius and H-Free Graphs
par: Lucke, Felicia, et autres
Publié: (2024)

The Computational Complexity of Positive Non-Clashing Teaching in Graphs
par: Ganian, Robert, et autres
Publié: (2025)

On the Parameterized Complexity of Grundy Domination and Zero Forcing Problems
par: Scheffler, Robert
Publié: (2025)

Graph Search Trees and the Intermezzo Problem
par: Beisegel, Jesse, et autres
Publié: (2024)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths and Cycles I: Treewidth, Pathwidth, and Grid Graphs
par: Beisegel, Jesse, et autres
Publié: (2025)

Parameterized Complexity of (d,r)-Domination via Modular Decomposition
par: Cordasco, Gennaro, et autres
Publié: (2024)

Graph Classes Closed under Self-intersection
par: Dabrowski, Konrad K., et autres
Publié: (2025)

Steiner Forest for $H$-Subgraph-Free Graphs
par: Eagling-Vose, Tala, et autres
Publié: (2026)

Complexity of the (Connected) Cluster Vertex Deletion problem on $H$-free graphs
par: Le, Hoang-Oanh, et autres
Publié: (2024)

Computing Subset Vertex Covers in $H$-Free Graphs
par: Brettell, Nick, et autres
Publié: (2023)

Finding $d$-Cuts in Probe $H$-Free Graphs
par: Dabrowski, Konrad K., et autres
Publié: (2025)

Single-Machine Scheduling to Minimize the Number of Tardy Jobs with Release Dates
par: Kaul, Matthias, et autres
Publié: (2024)

Treewidth Parameterized by Feedback Vertex Number
par: Molter, Hendrik, et autres
Publié: (2025)

Solving Problems on Generalized Convex Graphs via Mim-Width
par: Bonomo-Braberman, Flavia, et autres
Publié: (2020)

Optimal b-Colourings and Fall Colourings in $H$-Free Graphs
par: Ahn, Jungho, et autres
Publié: (2026)

A Graph Width Perspective on Partially Ordered Hamiltonian Paths
par: Beisegel, Jesse, et autres
Publié: (2025)

Placing Green Bridges Optimally, with a Multivariate Analysis
par: Fluschnik, Till, et autres
Publié: (2021)

A note on approximating the average degree of bounded arboricity graphs
par: Eden, Talya, et autres
Publié: (2026)

Multi-Pass Streaming Lower Bounds for Approximating Max-Cut
par: Fei, Yumou, et autres
Publié: (2025)

Relative-error unateness testing
par: Chen, Xi, et autres
Publié: (2025)

Parameterised distance to local irregularity
par: Fioravantes, Foivos, et autres
Publié: (2023)