Skip to content
Descubridor Institucional UMAR
Inicio
Búsqueda avanzada
Explorar
Inicio
Búsqueda avanzada
Explorar
Login
Language
English
Deutsch
Español
Français
Italiano
All Fields
Title
Author
Subject
Call Number
ISBN/ISSN
Tag
Find
Advanced
Tight Distance Query Reconstruction for Trees and Graphs Without Long Induced Cycles
Tight Distance Query Reconstruction for Trees and Graphs Without Long Induced Cycles
Fuente:
Wiley Open Access
Saved in:
Bibliographic Details
Main Authors:
Paul Bastide
,
Carla Groenland
Format:
Artículo Open Access
Published:
Wiley
2025
Subjects:
Random Structures & Algorithms
Online Access:
Acceder al recurso
Tags:
Add Tag
No Tags, Be the first to tag this record!
Cite this
Text this
Email this
Print
Export Record
Export to RefWorks
Export to EndNoteWeb
Export to EndNote
Save to List
Permanent link
Holdings
Description
Comments
Similar Items
Staff View
Internet
https://onlinelibrary.wiley.com/doi/10.1002/rsa.70017
Similar Items
Sequentially Constrained Hamilton Cycles in Random Graphs
by: Alan Frieze, et al.
Published: (2025)
Tight Anti‐Concentration of Rademacher Sums
by: Lawrence Hollom, et al.
Published: (2025)
Cycles with many chords
by: Nemanja Draganić, et al.
Published: (2024)
On the Maximum F$$ F $$‐Free Induced Subgraphs in Kt$$ {K}_t $$‐Free Graphs
by: József Balogh, et al.
Published: (2024)
On the Random Turán Number of Linear Cycles
by: Dhruv Mubayi, et al.
Published: (2026)