Imagen de Portada

Distance Adjustment of a Graph Drawing Stress Model

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Onoue, Yosuke
Formato:	Preprint
Publicado:	2024
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Top-Down Drawings of Compound Graphs
por: Kasperowski, Maximilian, et al.
Publicado: (2023)

Layered Graph Drawing with Few Gaps and Few Crossings
por: Dobler, Alexander, et al.
Publicado: (2025)

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing
por: Eppstein, David, et al.
Publicado: (2025)

Graph Exploration: The Impact of a Distance Constraint
por: Devismes, Stéphane, et al.
Publicado: (2024)

Unit-length Rectangular Drawings of Graphs
por: Alegria, Carlos, et al.
Publicado: (2022)

SS-GUMAP, SL-GUMAP, SSSL-GUMAP: Fast UMAP Algorithms for Large Graph Drawing
por: Meidiana, Amyra, et al.
Publicado: (2025)

Optimal Distance Labeling for Permutation Graphs
por: Gawrychowski, Paweł, et al.
Publicado: (2024)

Graph Spanners for Group Steiner Distances
por: Bilò, Davide, et al.
Publicado: (2024)

Distances in Planar Graphs are Almost for Free!
por: Mozes, Shay, et al.
Publicado: (2026)

Optimizing Distances for Multi-Broadcast in Temporal Graphs
por: Carnevale, Daniele, et al.
Publicado: (2026)

Path-Reporting Distance Oracles for Vertex-Labeled Graphs
por: Neiman, Ofer, et al.
Publicado: (2026)

Morphing Planar Graph Drawings Through 3D
por: Buchin, Kevin, et al.
Publicado: (2022)

BH-tsNET, FIt-tsNET, L-tsNET: Fast tsNET Algorithms for Large Graph Drawing
por: Meidiana, Amyra, et al.
Publicado: (2025)

Algorithms for Distance Sensitivity Oracles and other Graph Problems on the PRAM
por: Manoharan, Vignesh, et al.
Publicado: (2025)

Distance Reconstruction of Sparse Random Graphs
por: Bastide, Paul
Publicado: (2024)

BD-Index: Scalable Biharmonic Distance Queries on Large Graphs via Divide-and-Conquer Indexing
por: Pan, Yueyang, et al.
Publicado: (2025)

Optimal Algorithm for Paired-Domination in Distance-Hereditary Graphs
por: Mu, Ta-Yu, et al.
Publicado: (2024)

Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance Regime
por: Kociumaka, Tomasz, et al.
Publicado: (2025)

Simultaneous Drawing of Layered Trees
por: Katheder, Julia, et al.
Publicado: (2023)

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
por: Dobler, Alexander, et al.
Publicado: (2024)

Hamming Distance Oracle
por: Boneh, Itai, et al.
Publicado: (2024)

Dynamic Dyck and Tree Edit Distance: Decompositions and Reductions to String Edit Distance
por: Das, Debarati, et al.
Publicado: (2025)

Distance-Preserving Graph Compression Techniques
por: Madani, Amirali, et al.
Publicado: (2023)

Many Flavors of Edit Distance
por: Bhattacharya, Sudatta, et al.
Publicado: (2024)

Distributed Distance Sensitivity Oracles
por: Manoharan, Vignesh, et al.
Publicado: (2024)

Upward-Planar Drawings with Bounded Span
por: Angelini, Patrizio, et al.
Publicado: (2026)

Optimal Orthogonal Drawings in Linear Time
por: Didimo, Walter, et al.
Publicado: (2025)

On Planar Straight-Line Dominance Drawings
por: Angelini, Patrizio, et al.
Publicado: (2025)

Max-Distance Sparsification for Diversification and Clustering
por: Kumabe, Soh
Publicado: (2024)

Max-Min Diversification with Asymmetric Distances
por: Kumpulainen, Iiro, et al.
Publicado: (2025)

On Rotation Distance of Rank Bounded Trees
por: M., Anoop S. K., et al.
Publicado: (2023)

Fully Dynamic Algorithms for Chamfer Distance
por: Goranci, Gramoz, et al.
Publicado: (2025)

Fault-Tolerant Approximate Distance Oracles with a Source Set
por: Dey, Dipan, et al.
Publicado: (2025)

Internally-Convex Drawings of Outerplanar Graphs in Small Area
por: Bekos, Michael A., et al.
Publicado: (2025)

Ortho-Radial Drawing in Near-Linear Time
por: Chang, Yi-Jun
Publicado: (2023)

Data-Dependent LSH for the Earth Mover's Distance
por: Jayaram, Rajesh, et al.
Publicado: (2024)

Improved Distance (Sensitivity) Oracles with Subquadratic Space
por: Bilò, Davide, et al.
Publicado: (2024)

Almost Linear Size Edit Distance Sketch
por: Koucký, Michal, et al.
Publicado: (2024)

Path-Reporting Distance Oracles with Linear Size
por: Neiman, Ofer, et al.
Publicado: (2024)

Nearly Optimal Fault Tolerant Distance Oracle
por: Dey, Dipan, et al.
Publicado: (2024)