Copertina

Improved exploration of temporal graphs

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bastide, Paul, Groenland, Carla, Michel, Lukas, Rambaud, Clément
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms Combinatorics
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Faithful universal graphs for minor-closed classes
di: Bastide, Paul, et al.
Pubblicazione: (2025)

Quasi-linear distance query reconstruction for graphs of bounded treelength
di: Bastide, Paul, et al.
Pubblicazione: (2024)

Optimal distance query reconstruction for graphs without long induced cycles
di: Bastide, Paul, et al.
Pubblicazione: (2023)

Distance Reconstruction of Sparse Random Graphs
di: Bastide, Paul
Pubblicazione: (2024)

Making an oriented graph acyclic using inversions of bounded or prescribed size
di: Bang-Jensen, Jørgen, et al.
Pubblicazione: (2025)

Lower bounds for graph reconstruction with maximal independent set queries
di: Michel, Lukas, et al.
Pubblicazione: (2024)

Tight Distance Query Reconstruction for Trees and Graphs Without Long Induced Cycles
di: Paul Bastide, et al.
Pubblicazione: (2025)

Liar's vertex-edge domination in unit disk graph
di: Bhattacharya, Debojyoti, et al.
Pubblicazione: (2025)

Liar's vertex-edge domination in subclasses of chordal graphs
di: Bhattacharya, Debojyoti, et al.
Pubblicazione: (2025)

Designing sparse temporal graphs satisfying connectivity requirements
di: Bellitto, Thomas, et al.
Pubblicazione: (2026)

Reconstructing edge-deleted unicyclic graphs
di: Pizzimenti, Anthony E., et al.
Pubblicazione: (2024)

Cycle-factors of regular graphs via entropy
di: Christoph, Micha, et al.
Pubblicazione: (2025)

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
di: Bencs, Ferenc, et al.
Pubblicazione: (2025)

A note on Ordered Ruzsa-Szemerédi graphs
di: Pratt, Kevin
Pubblicazione: (2025)

Constructing disjoint Steiner trees in Sierpiński graphs
di: Yang, Chenxu, et al.
Pubblicazione: (2023)

On the complexity of edge subdivision to $H$-free graphs
di: Piecyk, Marta, et al.
Pubblicazione: (2026)

A Polynomial Time Algorithm for Steiner Tree when Terminals Avoid a $K_4$-Minor
di: Groenland, Carla, et al.
Pubblicazione: (2024)

Faster diameter computation in graphs of bounded Euler genus
di: Kluk, Kacper, et al.
Pubblicazione: (2025)

Testing H-freeness on sparse graphs, the case of bounded expansion
di: Humeau, Samuel, et al.
Pubblicazione: (2025)

On $G^p$-unimodality of radius functions in graphs: structure and algorithms
di: Chalopin, Jérémie, et al.
Pubblicazione: (2025)

Kernelization for list $H$-coloring for graphs with small vertex cover
di: Piecyk, Marta, et al.
Pubblicazione: (2025)

Sampling and counting triangle-free graphs near the critical density
di: Jenssen, Matthew, et al.
Pubblicazione: (2024)

Erdős-Gyárfás conjecture on graphs without long induced paths
di: Hegde, Anand Shripad, et al.
Pubblicazione: (2024)

On 2-strong connectivity orientations of mixed graphs and related problems
di: Georgiadis, Loukas, et al.
Pubblicazione: (2023)

Computing Tree Decompositions with Small Independence Number
di: Dallard, Clément, et al.
Pubblicazione: (2022)

Sparse induced subgraphs in $P_7$-free graphs of bounded clique number
di: Chudnovsky, Maria, et al.
Pubblicazione: (2024)

Eulerian-spanning set and coboundary operator: An investigation of maxcut beyond planar graphs
di: Fang, Qiming, et al.
Pubblicazione: (2026)

Sparse graphs with bounded induced cycle packing number have logarithmic treewidth
di: Bonamy, Marthe, et al.
Pubblicazione: (2022)

Face-hitting dominating sets in planar graphs: Alternative proof and linear-time algorithm
di: Biedl, Therese
Pubblicazione: (2025)

Sub-$n^k$ Deterministic algorithm for minimum $k$-way cut in simple graphs
di: Daga, Mohit
Pubblicazione: (2025)

The connectivity carcass of a vertex subset in a graph: both odd and even case
di: Baswana, Surender, et al.
Pubblicazione: (2025)

A refined graph container lemma and applications to the hard-core model on bipartite expanders
di: Jenssen, Matthew, et al.
Pubblicazione: (2024)

Improved Upper Bounds for the Directed Flow-Cut Gap
di: Bodwin, Greg, et al.
Pubblicazione: (2026)

Improved space-time tradeoff for TSP via extremal set systems
di: Dallant, Justin, et al.
Pubblicazione: (2026)

Burning rooted graph products
di: Peca-Medlin, John
Pubblicazione: (2026)

Algorithmic study on liar's vertex-edge domination problem
di: Bhattacharya, Debojyoti, et al.
Pubblicazione: (2023)

On constrained intersection representations of graphs and digraphs
di: Cicalese, Ferdinando, et al.
Pubblicazione: (2025)

Improved Shortest Path Restoration Lemmas for Multiple Edge Failures: Trade-offs Between Fault-tolerance and Subpaths
di: Bodwin, Greg, et al.
Pubblicazione: (2023)

Complexity Gaps between Point and Interval Temporal Graphs for some Reachability Problems
di: Aubian, Guillaume, et al.
Pubblicazione: (2025)

Parameterised algorithms for temporally satisfying reconfiguration problems
di: Davot, Tom, et al.
Pubblicazione: (2025)