Image de couverture de livre

Bandwidth vs BFS Width in Matrix Reordering, Graph Reconstruction, and Graph Drawing

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Eppstein, David, Goodrich, Michael T., Liu, Songyu
Format:	Preprint
Publié:	2025
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

Exact Learning of Weighted Graphs Using Composite Queries
par: Goodrich, Michael T., et autres
Publié: (2025)

Zip-Tries: Simple Dynamic Data Structures for Strings
par: Eppstein, David, et autres
Publié: (2025)

Visualizing Treewidth
par: Chiu, Alvin, et autres
Publié: (2025)

On the power of standard DFS and BFS
par: Bui-Xuan, Binh-Minh, et autres
Publié: (2026)

Parameterized Algorithms for Steiner Forest in Bounded Width Graphs
par: Feldmann, Andreas Emil, et autres
Publié: (2024)

Top-Down Drawings of Compound Graphs
par: Kasperowski, Maximilian, et autres
Publié: (2023)

Decremental Greedy Polygons and Polyhedra Without Sharp Angles
par: Eppstein, David
Publié: (2025)

Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time
par: Eppstein, David
Publié: (2023)

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

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

Finding Induced Subgraphs from Graphs with Small Mim-Width
par: Otachi, Yota, et autres
Publié: (2024)

Fast Geographic Routing in Fixed-Growth Graphs
par: Gila, Ofek, et autres
Publié: (2025)

Fast Schulze Voting Using Quickselect
par: Arora, Arushi, et autres
Publié: (2024)

Maintaining Light Spanners via Minimal Updates
par: Khodabandeh, Hadi, et autres
Publié: (2024)

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

Computational Complexities of Folding
par: Eppstein, David
Publié: (2024)

GraphBLAS Mathematical Opportunities: Parallel Hypersparse, Matrix Based Graph Streaming, and Complex-Index Matrices
par: Jananthan, Hayden, et autres
Publié: (2025)

Minimizing the Minimizers via Alphabet Reordering
par: Verbeek, Hilde, et autres
Publié: (2024)

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

MIOV: Reordering MOVI for even better locality
par: Perešíni, Peter, et autres
Publié: (2024)

BH-tsNET, FIt-tsNET, L-tsNET: Fast tsNET 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)

How to Sort in a Refrigerator: Simple Entropy-Sensitive Strictly In-Place Sorting Algorithms
par: Gila, Ofek, et autres
Publié: (2026)

Graph Reconstruction via MIS Queries
par: Konrad, Christian, et autres
Publié: (2024)

Bounding Width on Graph Classes of Constant Diameter
par: Dabrowski, Konrad K., et autres
Publié: (2025)

Graph Reconstruction with a Connected Components Oracle
par: Harviainen, Juha, et autres
Publié: (2025)

New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms
par: Abboud, Amir, et autres
Publié: (2023)

Fine-Grained Computation in 3-Space: Matrix Multiplication and Graph Problems
par: Stout, Quentin F.
Publié: (2024)

Accelerating Graph Neural Networks with a Novel Matrix Compression Format
par: Alves, João N. F., et autres
Publié: (2024)

Optimal Bounds for Open Addressing Without Reordering
par: Farach-Colton, Martin, et autres
Publié: (2025)

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

When is String Reconstruction using de Bruijn Graphs Hard?
par: Bals, Ben, et autres
Publié: (2025)

Sparse Graph Reconstruction and Seriation for Large-Scale Image Stacks
par: Yang, Fuming, et autres
Publié: (2025)

Distance Reconstruction of Sparse Random Graphs
par: Bastide, Paul
Publié: (2024)

A novel DFS/BFS approach towards link prediction
par: Dörpinghaus, Jens, et autres
Publié: (2024)

The Behavior of Tree-Width and Path-Width under Graph Operations and Graph Transformations
par: Gurski, Frank, et autres
Publié: (2024)

Parallel Cluster-BFS and Applications to Shortest Paths
par: Wang, Letong, et autres
Publié: (2024)

Improved Bounds for Twin-Width Parameter Variants with Algorithmic Applications to Counting Graph Colorings
par: Baril, Ambroise, et autres
Publié: (2025)

The Case for External Graph Sketching
par: Bender, Michael A., et autres
Publié: (2025)

Width Parameters for Minimum Flow Decomposition
par: Grigorjew, Andreas, et autres
Publié: (2024)