Cover Image

How Many Lines to Paint the City: Exact Edge-Cover in Temporal Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Deligkas, Argyrios, Döring, Michelle, Eiben, Eduard, Goldsmith, Tiger-Lily, Skretas, George, Tennigkeit, Georg
Format:	Preprint
Published:	2024
Subjects:	Social and Information Networks Discrete Mathematics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
by: Deligkas, Argyrios, et al.
Published: (2025)

Maximizing Reachability via Shifting of Temporal Paths
by: Deligkas, Argyrios, et al.
Published: (2026)

Parameterized Algorithms for Coordinated Motion Planning: Minimizing Energy
by: Deligkas, Argyrios, et al.
Published: (2024)

FO and MSO Model Checking on Temporal Graphs
by: Döring, Michelle, et al.
Published: (2026)

Minimizing Reachability Times on Temporal Graphs via Shifting Labels
by: Deligkas, Argyrios, et al.
Published: (2021)

Simple, Strict, Proper, and Directed: Comparing Reachability in Directed and Undirected Temporal Graphs
by: Döring, Michelle
Published: (2025)

EF1 and EFX Orientations
by: Deligkas, Argyrios, et al.
Published: (2024)

Stability in Distance Preservation Games on Graphs
by: Deligkas, Argyrios, et al.
Published: (2026)

A Minor-Testing Approach for Coordinated Motion Planning with Sliding Robots
by: Eiben, Eduard, et al.
Published: (2025)

The Complexity of Extending Fair Allocations of Indivisible Goods
by: Deligkas, Argyrios, et al.
Published: (2025)

How to Color Temporal Graphs to Ensure Proper Transitions
by: Ibiapina, Allen, et al.
Published: (2025)

The Complexity of Temporal Vertex Cover in Small-Degree Graphs
by: Hamm, Thekla, et al.
Published: (2022)

How to Reduce Temporal Cliques to Find Sparse Spanners
by: Angrick, Sebastian, et al.
Published: (2024)

Sharp Thresholds for Temporal Motifs and Doubling Time in Random Temporal Graphs
by: Austin, Henry, et al.
Published: (2026)

Light Edge Fault Tolerant Graph Spanners
by: Bodwin, Greg, et al.
Published: (2025)

Cops & Robber on Periodic Temporal Graphs
by: De Carufel, Jean-Lou, et al.
Published: (2024)

Exact Biclique Partition number of Split Graphs
by: Babu, Anand, et al.
Published: (2025)

On Modular Edge Colourings of Graphs
by: Berthe, Gaétan, et al.
Published: (2025)

Highly Connected Steiner Subgraph -- Parameterized Algorithms and Applications to Hitting Set Problems
by: Eiben, Eduard, et al.
Published: (2023)

An Algorithm for the Decomposition of Complete Graph into Minimum Number of Edge-disjoint Trees
by: Sinha, Antika, et al.
Published: (2024)

Line Graphs of Non-Word-Representable Graphs are Not Always Non-Word-Representable
by: Mozhui, Khyodeno, et al.
Published: (2025)

Graphs With the Same Edge Count in Each Neighborhood
by: Sheffield, Nathan S., et al.
Published: (2025)

Temporal Graph Realization With Bounded Stretch
by: Mertzios, George B., et al.
Published: (2025)

Structural Parameters for Dense Temporal Graphs
by: Enright, Jessica, et al.
Published: (2024)

Boundedness and Separation in the Graph Covering Number Framework
by: Goetze, Miriam, et al.
Published: (2025)

Covering Complete Geometric Graphs by Monotone Paths
by: Dumitrescu, Adrian, et al.
Published: (2025)

Numbering Combinations for Compact Representation of Many-to-Many Relationship Sets
by: Tomovic, Savo
Published: (2025)

On the Gap between Hereditary Discrepancy and the Determinant Lower Bound
by: Li, Lily, et al.
Published: (2023)

A Simplified Proof for the Edge-Density of 4-Planar Graphs
by: Büngener, Aaron
Published: (2025)

Graphons of Line Graphs
by: Kandanaarachchi, Sevvandi, et al.
Published: (2024)

On Euler Paths and the Maximum Degree Growth of Iterated Higher Order Line Graphs
by: Sanghi, Aryan, et al.
Published: (2026)

Multimodal Search on a Line
by: Coleman, Jared, et al.
Published: (2025)

A Temporal Graph Model to Study the Dynamics of Collective Behavior and Performance in Team Sports: An Application to Basketball
by: Bourgeais, Quentin, et al.
Published: (2024)

Highly Connected Graph Partitioning: Exact Formulation and Solution Methods
by: Swamy, Rahul, et al.
Published: (2024)

Fanciful Figurines flip Free Flood-It -- Polynomial-Time Miniature Painting on Co-gem-free Graphs
by: Rosenke, Christian, et al.
Published: (2026)

The Complexity of Intersection Graphs of Lines in Space and Circle Orders
by: Cardinal, Jean
Published: (2024)

Edge Clique Partition and Cover Beyond Independence
by: Fomin, Fedor V., et al.
Published: (2025)

On 3-Connected Planar Graphs with Unique Orientable Circuit Double Covers
by: Weiß, Meike, et al.
Published: (2026)

Short Proof: Exact Solution to the Finite Frobenius Coin Problem
by: De Gaspari, Lorenzo, et al.
Published: (2025)

Dividing Indivisible Items for the Benefit of All: It is Hard to Be Fair Without Social Awareness
by: Deligkas, Argyris, et al.
Published: (2025)