Imagen de Portada

Finding Minimal Clusters in st-DAGs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Vogl, Ulrich, Siegle, Markus
Formato:	Preprint
Publicado:	2026
Materias:	Discrete Mathematics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Token Sliding Reconfiguration on DAGs
por: Dirks, Jona, et al.
Publicado: (2025)

Computing $\vec{\mathcal{S}}$-DAGs and Parity Games
por: Hatzel, Meike, et al.
Publicado: (2024)

Characterizing and Transforming DAGs within the I-LCA Framework
por: Hellmuth, Marc, et al.
Publicado: (2024)

Inferring DAGs and Phylogenetic Networks from Least Common Ancestors
por: Lindeberg, Anna, et al.
Publicado: (2025)

Simplifying and Characterizing DAGs and Phylogenetic Networks via Least Common Ancestor Constraints
por: Lindeberg, Anna, et al.
Publicado: (2024)

The Complexity of Finding Tangles
por: Firman, Oksana, et al.
Publicado: (2020)

Algorithms and complexity for path covers of temporal DAGs: when is Dilworth dynamic?
por: Chakraborty, Dibyayan, et al.
Publicado: (2024)

Minimizing breaks by minimizing odd cycle transversals
por: Fujii, Koichi, et al.
Publicado: (2024)

Elimination Distance to Dominated Clusters
por: Schirrmacher, Nicole, et al.
Publicado: (2025)

Efficient Algorithms for Minimizing the Kirchhoff Index via Adding Edges
por: Zhou, Xiaotian, et al.
Publicado: (2025)

The Power of Amortization on Minimizing Total Completion Time with Explorable Uncertainty
por: Krekelberg, Bob, et al.
Publicado: (2025)

Finding a Sparse Connected Spanning Subgraph in a non-Uniform Failure Model
por: Bentert, Matthias, et al.
Publicado: (2023)

On Obtaining New MUBs by Finding Points on Complete Intersection Varieties over $\mathbb{R}$
por: Banerjee, Arindam, et al.
Publicado: (2025)

Word-representability and comparability: Minimal forbidden induced subgraphs and cover number bounds
por: Kenkireth, Benny George, et al.
Publicado: (2025)

A Euclidean Distance Matrix Model for Convex Clustering
por: Wang, Zhaowei, et al.
Publicado: (2021)

Approximation Algorithms for Minimizing Congestion in Demand-Aware Networks
por: Dai, Wenkai, et al.
Publicado: (2024)

Clustered independence and bounded treewidth
por: Knauer, Kolja, et al.
Publicado: (2023)

Enumerating Minimal Defensive Alliances
por: Feng, Zhidan, et al.
Publicado: (2023)

Logarithmic Mixing of Random Walks on Dynamical Random Cluster Models
por: Galanis, Andreas, et al.
Publicado: (2026)

Edge-Colored Clustering in Hypergraphs: Beyond Minimizing Unsatisfied Edges
por: Crane, Alex, et al.
Publicado: (2025)

A New Method for Finding the Schulze Winner Set
por: Fujishige, Satoru, et al.
Publicado: (2026)

Second Price Matching with Complete Allocation and Degree Constraints
por: Pinchasi, Rom, et al.
Publicado: (2025)

Covering a Graph with Minimal Local Sets
por: Claudet, Nathan, et al.
Publicado: (2024)

The 27-qubit Counterexample to the LU-LC Conjecture is Minimal
por: Claudet, Nathan
Publicado: (2026)

Automated Mathematical Discovery and Verification: Minimizing Pentagons in the Plane
por: Subercaseaux, Bernardo, et al.
Publicado: (2023)

From the Finite to the Infinite: Sharper Asymptotic Bounds on Norin's Conjecture via SAT
por: Kirchweger, Markus, et al.
Publicado: (2025)

Hardness of Finding Kings and Strong Kings
por: Alaoui, Ziad Ismaili, et al.
Publicado: (2025)

Discrepancy Minimization via Regularization
por: Pesenti, Lucas, et al.
Publicado: (2022)

Pentagon Minimization without Computation
por: Mackey, John, et al.
Publicado: (2024)

Mixed-integer linear programming approaches for nested $p$-center problems with absolute and relative regret objectives
por: Brandstetter, Christof, et al.
Publicado: (2024)

Finding d-Cuts in Claw-free Graphs
por: Ahn, Jungho, et al.
Publicado: (2025)

Partial Optimality in Cubic Correlation Clustering for General Graphs
por: Stein, David, et al.
Publicado: (2025)

How to Reduce Temporal Cliques to Find Sparse Spanners
por: Angrick, Sebastian, et al.
Publicado: (2024)

Optimal Multi-agent Path Finding in Continuous Time
por: Combrink, Alvin, et al.
Publicado: (2025)

Finding Minimum Matching Cuts in $H$-free Graphs
por: Lucke, Felicia, et al.
Publicado: (2025)

Fast Makespan Minimization via Short ILPs
por: Hermelin, Danny, et al.
Publicado: (2026)

Parameterized Complexity of Submodular Minimization under Uncertainty
por: Kakimura, Naonori, et al.
Publicado: (2024)

A Theory of Conversion Relations for Prefixed Units of Measure
por: Widemann, Baltasar Trancón y, et al.
Publicado: (2022)

A Unified Approach to Minimizing Symmetric Submodular Functions
por: Iwata, Satoru, et al.
Publicado: (2026)

Di-Graphs with tightly connected Clusters: Effective Graph Laplacians and Resolvent Convergence
por: Koke, Christian
Publicado: (2026)