Imagen de Portada

Quasi-linear distance query reconstruction for graphs of bounded treelength

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bastide, Paul, Groenland, Carla
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms Discrete Mathematics Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

Clique-free t-matchings in degree-bounded graphs
por: Paluch, Katarzyna, et al.
Publicado: (2024)

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

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
por: Bonamy, Marthe, et al.
Publicado: (2020)

Perturbation results for distance-edge-monitoring numbers
por: Yang, Chenxu, et al.
Publicado: (2023)

Paths and Intersections: Characterization of Quasi-metrics in Directed Okamura-Seymour Instances
por: Chen, Yu, et al.
Publicado: (2024)

Improved bounds for coloring locally sparse hypergraphs
por: Iliopoulos, Fotis
Publicado: (2020)

A logarithmic approximation of linearly ordered colourings
por: Håstad, Johan, et al.
Publicado: (2024)

Translating between the representations of an acyclic convex geometry of bounded degree
por: Defrain, Oscar, et al.
Publicado: (2025)

Interval H-graphs : Recognition and forbidden obstructions
por: Müller, Haiko, et al.
Publicado: (2025)

On the Houdré-Tetali conjecture about an isoperimetric constant of graphs
por: Lau, Lap Chi, et al.
Publicado: (2024)

Holey graphs: very large Betti numbers are testable
por: Szabó, Dániel, et al.
Publicado: (2024)

Enumerating minimal solution sets for metric graph problems
por: Bergougnoux, Benjamin, et al.
Publicado: (2023)

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

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

Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
por: Korhonen, Tuukka, et al.
Publicado: (2024)

A linear-time algorithm for $(1+ε)Δ$-edge-coloring
por: Bernshteyn, Anton, et al.
Publicado: (2024)

Improved bounds for the zeros of the chromatic polynomial via Whitney's Broken Circuit Theorem
por: Jenssen, Matthew, et al.
Publicado: (2023)

On the complexity of finding a spanning even tree in a graph
por: Hanaka, Tesshu, et al.
Publicado: (2024)

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

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

Enumerating minimal dominating sets and variants in chordal bipartite graphs
por: Castelo, Emanuel, et al.
Publicado: (2025)

Sparsest cut and eigenvalue multiplicities on low degree Abelian Cayley graphs
por: d'Orsi, Tommaso, et al.
Publicado: (2024)

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

On the time complexity of finding a well-spread perfect matching in bridgeless cubic graphs
por: Ghanbari, Babak, et al.
Publicado: (2025)

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
por: Majewski, Konrad, et al.
Publicado: (2022)

Maximum list $r$-colorable induced subgraphs in $kP_3$-free graphs
por: Galby, Esther, et al.
Publicado: (2025)

A new width parameter of graphs based on edge cuts: $α$-edge-crossing width
por: Chang, Yeonsu, et al.
Publicado: (2023)

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

Twin-width one
por: Ahn, Jungho, et al.
Publicado: (2025)

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

Circle graphs can be recognized in linear time
por: Paul, Christophe, et al.
Publicado: (2025)

Near-linear time subhypergraph counting in bounded degeneracy hypergraphs
por: Paul-Pena, Daniel, et al.
Publicado: (2025)

Prefix-bounded matrices
por: Borsik, Nóra A., et al.
Publicado: (2025)

Deterministic approximate counting of colorings with fewer than $2Δ$ colors via absence of zeros
por: Bencs, Ferenc, et al.
Publicado: (2024)

Approximating maximum-size properly colored forests
por: Bai, Yuhang, et al.
Publicado: (2024)

Problems on Group-labeled Matroid Bases
por: Hörsch, Florian, et al.
Publicado: (2024)

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

Rainbow Arborescence Conjecture
por: Bérczi, Kristóf, et al.
Publicado: (2024)