Imagen de Portada

On $G^p$-unimodality of radius functions in graphs: structure and algorithms

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chalopin, Jérémie, Chepoi, Victor, Dragan, Feodor, Ducoffe, Guillaume, Vaxès, Yann
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

$α_i$-Metric Graphs: Hyperbolicity
por: Dragan, Feodor F., et al.
Publicado: (2024)

Isometric path complexity of graphs
por: Chakraborty, Dibyayan, et al.
Publicado: (2022)

Bow Metrics and Hyperbolicity
por: Dragan, Feodor F., et al.
Publicado: (2024)

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

Graph parameters that are coarsely equivalent to tree-length
por: Dragan, Feodor F.
Publicado: (2025)

Non-Clashing Teaching Maps for Balls in Graphs
por: Chalopin, Jérémie, et al.
Publicado: (2023)

Graph parameters that are coarsely equivalent to path-length
por: Dragan, Feodor F., et al.
Publicado: (2025)

Generating minimal redundant and maximal irredundant sets in incidence graphs
por: Castelo, Emanuel, et al.
Publicado: (2026)

Additive approximation algorithm for geodesic centers in $δ$-hyperbolic graphs
por: Chakraborty, Dibyayan, et al.
Publicado: (2024)

ABC(T)-graphs: an axiomatic characterization of the median procedure in graphs with connected and G$^2$-connected medians
por: Bénéteau, Laurine, et al.
Publicado: (2022)

Lower bounds on collective additive spanners
por: Corneil, Derek G., et al.
Publicado: (2025)

A fine-grained dichotomy for the center problem on Gromov hyperbolic graphs
por: Ducoffe, Guillaume
Publicado: (2026)

Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
por: Dragan, Feodor F., et al.
Publicado: (2018)

Quasilinear-time eccentricities computation, and more, on median graphs
por: Bergé, Pierre, et al.
Publicado: (2024)

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

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

An efficient algorithm for $\mathcal{F}$-subgraph-free Edge Deletion on graphs having a product structure
por: An, Shinwoo, et al.
Publicado: (2025)

An algorithmic Polynomial Freiman-Ruzsa theorem
por: Castro-Silva, Davi, et al.
Publicado: (2026)

Improved exploration of temporal graphs
por: Bastide, Paul, et al.
Publicado: (2025)

Asymptotically faster algorithms for recognizing $(k,\ell)$-sparse graphs
por: Deák, Bence, et al.
Publicado: (2026)

Lettericity of graphs: an FPT algorithm and a bound on the size of obstructions
por: Alecu, Bogdan, et al.
Publicado: (2024)

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

A faster algorithm for Vertex Cover parameterized by solution size
por: Harris, David G., et al.
Publicado: (2022)

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

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

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

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

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

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

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

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

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

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

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

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

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

A LP-rounding based algorithm for soft capacitated facility location problem with submodular penalties
por: Xiao, Hanyin, et al.
Publicado: (2025)

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

Bounded indegree $k$-forests problem and a faster algorithm for directed graph augmentation
por: Arkhipov, Pavel, et al.
Publicado: (2024)

An efficient recursive decomposition algorithm for undirected graphs
por: Heng, Pei, et al.
Publicado: (2026)