Sorting and Ranking of Self-Delimiting Numbers with Applications to Outerplanar Graph Isomorphism
Fuente:
arXiv
Saved in:
| Main Authors: | Kammer, Frank, Meintrup, Johannes, Sajenko, Andrej |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Space-Efficient Graph Kernelizations
by: Kammer, Frank, et al.
Published: (2020)
by: Kammer, Frank, et al.
Published: (2020)
New Sorting Algorithm Wave Sort (W-Sort)
by: Wei, Jia Xu
Published: (2025)
by: Wei, Jia Xu
Published: (2025)
Unsplittable Multicommodity Flows in Outerplanar Graphs
by: Alemán-Espinosa, David, et al.
Published: (2025)
by: Alemán-Espinosa, David, et al.
Published: (2025)
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
by: Duan, Ran, et al.
Published: (2025)
by: Duan, Ran, et al.
Published: (2025)
On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
by: Goswami, Mayank, et al.
Published: (2022)
by: Goswami, Mayank, et al.
Published: (2022)
Fast and Simple Sorting Using Partial Information
by: Haeupler, Bernhard, et al.
Published: (2024)
by: Haeupler, Bernhard, et al.
Published: (2024)
Improving Online Bin Covering with Little Advice
by: Brodnik, Andrej, et al.
Published: (2025)
by: Brodnik, Andrej, et al.
Published: (2025)
Finding All Bounded-Length Simple Cycles in a Directed Graph -- Revisited
by: Bauernöppel, Frank, et al.
Published: (2025)
by: Bauernöppel, Frank, et al.
Published: (2025)
Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings
by: Hammer, Nina, et al.
Published: (2022)
by: Hammer, Nina, et al.
Published: (2022)
Approximation Schemes for k-Subset Sum Ratio and k-way Number Partitioning Ratio
by: Kanellopoulos, Sotiris, et al.
Published: (2025)
by: Kanellopoulos, Sotiris, et al.
Published: (2025)
Succinct Planar Encoding with Minor Operations
by: Kammer, Frank, et al.
Published: (2023)
by: Kammer, Frank, et al.
Published: (2023)
Approximating Maximum Cut on Interval Graphs and Split Graphs beyond Goemans-Williamson
by: Ahn, Jungho, et al.
Published: (2025)
by: Ahn, Jungho, et al.
Published: (2025)
Efficiency of Self-Adjusting Heaps
by: Sinnamon, Corwin, et al.
Published: (2023)
by: Sinnamon, Corwin, et al.
Published: (2023)
On Hardness and Approximation of Broadcasting in Structured Graphs
by: Bringolf, Jeffrey, et al.
Published: (2025)
by: Bringolf, Jeffrey, et al.
Published: (2025)
Colorful Vertex Recoloring of Bipartite Graphs
by: Patt-Shamir, Boaz, et al.
Published: (2025)
by: Patt-Shamir, Boaz, et al.
Published: (2025)
SimdQuickHeap: The QuickHeap Reconsidered
by: Breitling, Johannes, et al.
Published: (2026)
by: Breitling, Johannes, et al.
Published: (2026)
Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs
by: Chuzhoy, Julia, et al.
Published: (2025)
by: Chuzhoy, Julia, et al.
Published: (2025)
Weighted Emulators with Local Heaviest Edges Stretch for Undirected Graphs
by: Roditty, Liam, et al.
Published: (2026)
by: Roditty, Liam, et al.
Published: (2026)
Graph Threading
by: Demaine, Erik D., et al.
Published: (2023)
by: Demaine, Erik D., et al.
Published: (2023)
Almost-Optimal Approximation Algorithms for Global Minimum Cut in Directed Graphs
by: Mosenzon, Ron
Published: (2025)
by: Mosenzon, Ron
Published: (2025)
Protecting the Connectivity of a Graph Under Non-Uniform Edge Failures
by: Hommelsheim, Felix, et al.
Published: (2025)
by: Hommelsheim, Felix, et al.
Published: (2025)
Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
by: Balzotti, Lorenzo
Published: (2020)
by: Balzotti, Lorenzo
Published: (2020)
Approximate Minimum Sum Colorings and Maximum $k$-Colorable Subgraphs of Chordal Graphs
by: DeHaan, Ian, et al.
Published: (2024)
by: DeHaan, Ian, et al.
Published: (2024)
Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings
by: Elberfeld, Michael, et al.
Published: (2025)
by: Elberfeld, Michael, et al.
Published: (2025)
Maintaining Routing Structures under Deletions via Self-Pruning
by: Haeupler, Bernhard, et al.
Published: (2025)
by: Haeupler, Bernhard, et al.
Published: (2025)
Near-Linear Time Computation of Welzl Orders on Graphs with Linear Neighborhood Complexity
by: Dreier, Jan, et al.
Published: (2026)
by: Dreier, Jan, et al.
Published: (2026)
Multiplication of 0-1 matrices via clustering
by: Jansson, Jesper, et al.
Published: (2025)
by: Jansson, Jesper, et al.
Published: (2025)
Fast approximate $\ell$-center clustering in high dimensional spaces
by: Kowaluk, Mirosław, et al.
Published: (2025)
by: Kowaluk, Mirosław, et al.
Published: (2025)
Fast FPT Algorithms for Grundy Number on Dense Graphs
by: Nezhad, Sina Ghasemi, et al.
Published: (2024)
by: Nezhad, Sina Ghasemi, et al.
Published: (2024)
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop
by: Antoniadis, Antonios, et al.
Published: (2020)
by: Antoniadis, Antonios, et al.
Published: (2020)
Online Combinatorial Optimization with Graphical Dependencies
by: Gao, Zhimeng, et al.
Published: (2025)
by: Gao, Zhimeng, et al.
Published: (2025)
Offline green bin packing and its constrained variant
by: Gong, Mingyang, et al.
Published: (2026)
by: Gong, Mingyang, et al.
Published: (2026)
Exploiting Low Scanwidth to Resolve Soft Polytomies
by: Bruchhold, Sebastian, et al.
Published: (2025)
by: Bruchhold, Sebastian, et al.
Published: (2025)
A sufficient condition for characterizing the one-sided testable properties of families of graphs in the Random Neighbour Oracle Model
by: Awofeso, Christine, et al.
Published: (2025)
by: Awofeso, Christine, et al.
Published: (2025)
Online computation of normalized substring complexity
by: Kucherov, Gregory, et al.
Published: (2025)
by: Kucherov, Gregory, et al.
Published: (2025)
Approximation algorithms for scheduling with rejection in green manufacturing
by: Gong, Mingyang, et al.
Published: (2025)
by: Gong, Mingyang, et al.
Published: (2025)
The cost of cyclic permutations and remainder sums in the Euclidean algorithm
by: Blomer, Valentin, et al.
Published: (2026)
by: Blomer, Valentin, et al.
Published: (2026)
A Faster Directed Single-Source Shortest Path Algorithm
by: Duan, Ran, et al.
Published: (2026)
by: Duan, Ran, et al.
Published: (2026)
Polytope Scheduling with Groups: Unified Models and Optimal Guarantees
by: Lindermayr, Alexander, et al.
Published: (2025)
by: Lindermayr, Alexander, et al.
Published: (2025)
Minimum Riesz s-Energy Subset Selection in Ordered Point Sets via Dynamic Programming
by: Emmerich, Michael
Published: (2025)
by: Emmerich, Michael
Published: (2025)
Similar Items
-
Space-Efficient Graph Kernelizations
by: Kammer, Frank, et al.
Published: (2020) -
New Sorting Algorithm Wave Sort (W-Sort)
by: Wei, Jia Xu
Published: (2025) -
Unsplittable Multicommodity Flows in Outerplanar Graphs
by: Alemán-Espinosa, David, et al.
Published: (2025) -
Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
by: Duan, Ran, et al.
Published: (2025) -
On Instance-Optimal Algorithms for a Generalization of Nuts and Bolts and Generalized Sorting
by: Goswami, Mayank, et al.
Published: (2022)