Copertina

Symmetry-breaking symmetry in directed spectral partitioning

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Pasadakis, Dimosthenis, Steiner, Raphael S., Papp, Pál András, Böhnlein, Toni, Yzelman, Albert-Jan N.
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Approximate Realizations for Outerplanaric Degree Sequences
di: Bar-Noy, Amotz, et al.
Pubblicazione: (2024)

Short circuit walks in fixed dimension
di: Black, Alexander E., et al.
Pubblicazione: (2025)

Symmetry Preservation in Swarms of Oblivious Robots with Limited Visibility
di: Gerlach, Raphael, et al.
Pubblicazione: (2024)

Multiprocessor Scheduling with Memory Constraints: Fundamental Properties and Finding Optimal Solutions
di: Papp, Pál András, et al.
Pubblicazione: (2025)

Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs
di: Böhnlein, Toni, et al.
Pubblicazione: (2024)

Replication in Graph Partitioning and Scheduling Problems
di: Papp, Pál András, et al.
Pubblicazione: (2026)

Dependent randomized rounding for clustering and partition systems with knapsack constraints
di: Harris, David G., et al.
Pubblicazione: (2017)

Graph matching based on similarities in structure and attributes
di: Candelier, Raphaël
Pubblicazione: (2024)

Complexity of polytope diameters via perfect matchings
di: Nöbel, Christian, et al.
Pubblicazione: (2024)

Computing Flows in Subquadratic Space
di: Brand, Jan van den, et al.
Pubblicazione: (2026)

String Indexing with Compressed Patterns
di: Bille, Philip, et al.
Pubblicazione: (2019)

KeBaB: $k$-mer based breaking for finding long MEMs
di: Brown, Nathaniel K., et al.
Pubblicazione: (2025)

Efficient algorithm for linear diophantine equations in two variables
di: Deora, Mayank, et al.
Pubblicazione: (2025)

An improvement of degree-based hashing (DBH) graph partition method, using a novel metric
di: Mastikhina, Anna, et al.
Pubblicazione: (2024)

Degree Realization by Bipartite Cactus Graphs
di: Bar-Noy, Amotz, et al.
Pubblicazione: (2025)

Longest Common Extension of a Dynamic String in Parallel Constant Time
di: Albert, Daniel
Pubblicazione: (2026)

Ultrabubble enumeration via a lowest common ancestor approach
di: Zisis, Athanasios E., et al.
Pubblicazione: (2026)

Accelerating Maximum Common Subgraph Computation by Exploiting Symmetries
di: Kothalawala, Buddhi, et al.
Pubblicazione: (2026)

Private graph colouring with limited defectiveness
di: Christiansen, Aleksander B. G., et al.
Pubblicazione: (2024)

Simple parallel estimation of the partition ratio for Gibbs distributions
di: Harris, David G., et al.
Pubblicazione: (2025)

Balanced TSP partitioning
di: Berendsohn, Benjamin Aram, et al.
Pubblicazione: (2025)

An FPRAS for two terminal reliability in directed acyclic graphs
di: Feng, Weiming, et al.
Pubblicazione: (2023)

A Gentle Wakeup Call: Symmetry Breaking with Less Collision Cost
di: Biswas, Umesh, et al.
Pubblicazione: (2025)

String Indexing for Top-$k$ Close Consecutive Occurrences
di: Bille, Philip, et al.
Pubblicazione: (2020)

Similarity analysis of DNA sequences through local distribution of nucleotides in strategic neighborhood
di: Mondal, Probir, et al.
Pubblicazione: (2023)

Gapped String Indexing in Subquadratic Space and Sublinear Query Time
di: Bille, Philip, et al.
Pubblicazione: (2022)

Data reduction for directed feedback vertex set on graphs without long induced cycles
di: Dirks, Jona, et al.
Pubblicazione: (2023)

Efficient Parallel Scheduling for Sparse Triangular Solvers
di: Böhnlein, Toni, et al.
Pubblicazione: (2025)

The problem of computing a $2$-T-connected spanning subgraph with minimum number of edges in directed graphs
di: Jaberi, Raed, et al.
Pubblicazione: (2024)

Fully Dynamic Graph Algorithms with Edge Differential Privacy
di: Raskhodnikova, Sofya, et al.
Pubblicazione: (2024)

A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation
di: Crane, Alex, et al.
Pubblicazione: (2026)

A note on finding long directed cycles above the minimum degree bound in 2-connected digraphs
di: Czyżewska, Jadwiga, et al.
Pubblicazione: (2025)

Solving the unit-load pre-marshalling problem in block stacking storage systems with multiple access directions
di: Pfrommer, Jakob, et al.
Pubblicazione: (2022)

Spectral partitioning of graphs into compact, connected regions
di: Davies, Ewan, et al.
Pubblicazione: (2025)

A Quantum Constraint Generation Framework for Binary Linear Programs
di: Czégel, András, et al.
Pubblicazione: (2025)

Exact Sampling of Permutations with a Fixed Longest Increasing Subsequence
di: Clifford, Peter, et al.
Pubblicazione: (2026)

Efficient Trace Frequency Queries in Sparse Graphs
di: Awofeso, Christine, et al.
Pubblicazione: (2025)

Finding the diameter of a tree with distance queries
di: Gerbner, Dániel, et al.
Pubblicazione: (2025)

Finding subdigraphs in digraphs of bounded directed treewidth
di: Lopes, Raul, et al.
Pubblicazione: (2025)

An improved spectral lower bound of treewidth
di: Gima, Tatsuya, et al.
Pubblicazione: (2024)