Image de couverture de livre

Top-Down Drawings of Compound Graphs

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Kasperowski, Maximilian, von Hanxleden, Reinhard
Format:	Preprint
Publié:	2023
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Diagram Control and Model Order for Sugiyama Layouts
par: Domrös, Sören, et autres
Publié: (2024)

Distance Adjustment of a Graph Drawing Stress Model
par: Onoue, Yosuke
Publié: (2024)

Layered Graph Drawing with Few Gaps and Few Crossings
par: Dobler, Alexander, et autres
Publié: (2025)

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing
par: Eppstein, David, et autres
Publié: (2025)

Differentially Private Release of Hierarchical Origin/Destination Data with a TopDown Approach
par: Boninsegna, Fabrizio, et autres
Publié: (2024)

InfTDA: A Simple TopDown Mechanism for Hierarchical Differentially Private Counting Queries
par: Boninsegna, Fabrizio
Publié: (2025)

Simultaneous Drawing of Layered Trees
par: Katheder, Julia, et autres
Publié: (2023)

Unit-length Rectangular Drawings of Graphs
par: Alegria, Carlos, et autres
Publié: (2022)

SS-GUMAP, SL-GUMAP, SSSL-GUMAP: Fast UMAP Algorithms for Large Graph Drawing
par: Meidiana, Amyra, et autres
Publié: (2025)

Morphing Planar Graph Drawings Through 3D
par: Buchin, Kevin, et autres
Publié: (2022)

BH-tsNET, FIt-tsNET, L-tsNET: Fast tsNET Algorithms for Large Graph Drawing
par: Meidiana, Amyra, et autres
Publié: (2025)

Approximating the Top Eigenvector in Random Order Streams
par: Kacham, Praneeth, et autres
Publié: (2024)

String Indexing for Top-$k$ Close Consecutive Occurrences
par: Bille, Philip, et autres
Publié: (2020)

Fairness in Aggregation: Optimal Top-$k$ and Improved Full Ranking
par: Chakraborty, Diptarka, et autres
Publié: (2026)

Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
par: Xu, Zhenxiang, et autres
Publié: (2024)

Upward-Planar Drawings with Bounded Span
par: Angelini, Patrizio, et autres
Publié: (2026)

Optimal Orthogonal Drawings in Linear Time
par: Didimo, Walter, et autres
Publié: (2025)

On Planar Straight-Line Dominance Drawings
par: Angelini, Patrizio, et autres
Publié: (2025)

Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets, Terminals & Top-k Nearest Neighbors
par: Chatziafratis, Vaggos, et autres
Publié: (2023)

Internally-Convex Drawings of Outerplanar Graphs in Small Area
par: Bekos, Michael A., et autres
Publié: (2025)

Ortho-Radial Drawing in Near-Linear Time
par: Chang, Yi-Jun
Publié: (2023)

Almost-Linear Time Algorithms for Decremental Graphs: Min-Cost Flow and More via Duality
par: Brand, Jan van den, et autres
Publié: (2024)

Revisiting ILP Models for Exact Crossing Minimization in Storyline Drawings
par: Dobler, Alexander, et autres
Publié: (2024)

Online Graph Embedding in Star Graphs
par: Dallot, Julien, et autres
Publié: (2026)

A Simple Deterministic Reduction From Gomory-Hu Tree to Maxflow and Expander Decomposition
par: Gutenberg, Maximilian Probst, et autres
Publié: (2025)

Dynamic Connectivity with Expected Polylogarithmic Worst-Case Update Time
par: Meierhans, Simon, et autres
Publié: (2025)

Top-k Stabbing Interval Queries
par: Akram, Waseem, et autres
Publié: (2024)

An Approximation Algorithm for Graph Label Selection
par: John, Josia, et autres
Publié: (2026)

Temporal Graph Reconfiguration for Always-Connected Graphs
par: Sievers, Paul, et autres
Publié: (2025)

Near-Optimal Algorithm for Directed Expander Decompositions
par: Sulser, Aurelio L., et autres
Publié: (2024)

Embedding Planar Graphs into Graphs of Treewidth $O(\log^{3} n)$
par: Chang, Hsien-Chih, et autres
Publié: (2024)

Expander Pruning with Polylogarithmic Worst-Case Recourse and Update Time
par: Meierhans, Simon, et autres
Publié: (2025)

Random-Shift Revisited: Tight Approximations for Tree Embeddings and L1-Oblivious Routings
par: Kyng, Rasmus, et autres
Publié: (2025)

On the Approximability of Max-Cut on 3-Colorable Graphs and Graphs with Large Independent Sets
par: Ghoshal, Suprovat, et autres
Publié: (2026)

Expander Hierarchies for Normalized Cuts on Graphs
par: Hanauer, Kathrin, et autres
Publié: (2024)

Generalized Top-k Mallows Model for Ranked Choices
par: Haddadan, Shahrzad, et autres
Publié: (2025)

Algebraic Vertex Ordering of a Sparse Graph for Adjacency Access Locality and Graph Compression
par: Floros, Dimitris, et autres
Publié: (2024)

Towards Tractability of the Diversity of Query Answers: Ultrametrics to the Rescue
par: Arenas, Marcelo, et autres
Publié: (2024)

Exactly Hittable Interval Graphs
par: Dhannya, S. M., et autres
Publié: (2023)

Sandpile Prediction on Undirected Graphs
par: Chang, Ruinian, et autres
Publié: (2023)