Imagen de Portada

Hierarchical threshold structure in Max-Cut with geometric edge weights

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Marić, Nevena
Formato:	Preprint
Publicado:	2026
Materias:	Combinatorics Discrete Mathematics Optimization and Control 05C70
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

An Explicit Formula for Vertex Enumeration in the CUT(n) Polytope via Probabilistic Methods
por: Marić, Nevena
Publicado: (2025)

On covering cubic graphs with three perfect matchings
por: Máčajová, Edita, et al.
Publicado: (2025)

Large induced subgraph with a given pathwidth in outerplanar graphs
por: Matsumoto, Naoki, et al.
Publicado: (2025)

The Linear Arboricity Conjecture for Graphs with Large Girth
por: Mishra, Tapas Kumar
Publicado: (2025)

Expanding vertices to triangles in cubic graphs
por: Mazzuoccolo, Giuseppe, et al.
Publicado: (2025)

Non-conflicting no-where zero $Z_2\times Z_2$ flows in cubic graphs
por: Mkrtchyan, Vahan
Publicado: (2024)

Valid Cuts for the Design of Potential-based Flow Networks
por: Börner, Pascal, et al.
Publicado: (2025)

Partitioning 2-edge-coloured bipartite graphs into monochromatic cycles
por: Benevides, Fabrício Siqueira, et al.
Publicado: (2024)

An NP-hardness result for the colored constrained maximum 2-edge-colorable subgraph problem in bipartite graphs
por: Mkrtchyan, Vahan
Publicado: (2024)

Ryser's Theorem for Symmetric $ρ$-latin Squares
por: Bahmanian, Amin, et al.
Publicado: (2022)

Exponential Lower Bounds for the Pfaffian Number of Graphs
por: Pant, Priyanshu, et al.
Publicado: (2026)

Hamilton decompositions of all directed tori at odd modulus
por: Park, SangHyun
Publicado: (2026)

On Edge-Disjoint Maximal Outerplanar Graphs
por: Okada, Yuto, et al.
Publicado: (2026)

Edge open packing: complexity, algorithmic aspects, and bounds
por: Brešar, Boštjan, et al.
Publicado: (2024)

Gallai's Path Decomposition for 2-degenerate Graphs
por: Anto, Nevil, et al.
Publicado: (2022)

Branching $k$-path vertex cover of forests
por: Makarov, Mikhail
Publicado: (2026)

Bond Polytope under Vertex- and Edge-sums
por: Kolman, Petr, et al.
Publicado: (2026)

Sparse Approximation in Lattices and Semigroups
por: Kuhlmann, Stefan, et al.
Publicado: (2024)

Stable Set Polytopes with High Lift-and-Project Ranks for the Lovász-Schrijver SDP Operator
por: Au, Yu Hin, et al.
Publicado: (2023)

On Rank-Monotone Graph Operations and Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
por: Au, Yu Hin, et al.
Publicado: (2024)

On Connections Between Association Schemes and Analyses of Polyhedral and Positive Semidefinite Lift-and-Project Relaxations
por: Au, Yu Hin, et al.
Publicado: (2020)

On Circuit Diameter Bounds via Circuit Imbalances
por: Dadush, Daniel, et al.
Publicado: (2021)

Max-Min and 1-Bounded Space Algorithms for the Bin Packing Problem
por: Fujiwara, Hiroshi, et al.
Publicado: (2025)

Graphs with core(G) = nucleus(G)
por: Levit, Vadim E., et al.
Publicado: (2026)

2-covers of wide Young diagrams
por: Aharoni, Ron, et al.
Publicado: (2023)

Roman domination in weighted graphs
por: Cera, Martín, et al.
Publicado: (2025)

List strong and list normal edge-coloring of (sub)cubic graphs
por: Lužar, Borut, et al.
Publicado: (2024)

Polytopes of alternating sign matrices with dihedral-subgroup symmetry
por: Madarasi, Péter
Publicado: (2026)

On the Number of Vertices/Edges whose Deletion Preserves the Konig-Egervary Property
por: Levit, Vadim E., et al.
Publicado: (2024)

On corona of Konig-Egervary graphs
por: Levit, Vadim E., et al.
Publicado: (2024)

Almost Bipartite non-König-Egerváry Graphs Revisited
por: Levit, Vadim E., et al.
Publicado: (2024)

A characterization of positive spanning sets with ties to strongly connected digraphs
por: Cornaz, Denis, et al.
Publicado: (2024)

Fractional list packing for layered graphs
por: Cambie, Stijn, et al.
Publicado: (2024)

Large independent sets in recursive Markov random graphs
por: Gupte, Akshay, et al.
Publicado: (2022)

A Computational Search for Minimal Obstruction Graphs for the Lovász--Schrijver SDP Hierarchy
por: Au, Yu Hin, et al.
Publicado: (2025)

Inversion diameter and 2-edge-colored homomorphisms
por: Arana, Carmen, et al.
Publicado: (2026)

Some results involving the $A_α$-eigenvalues for graphs and line graphs
por: Junior, Joao Domingos Gomes da Silva, et al.
Publicado: (2024)

Identifying faulty edges in resistive electrical networks
por: Fiedorowicz, Barbara, et al.
Publicado: (2025)

Maximum Cuts and Fractional Cut Covers: A Computational Study of a Randomized Semidefinite Programming Approach
por: Proença, Nathan Benedetto, et al.
Publicado: (2026)

On the structure of (dart, odd hole)-free graphs
por: Hoàng, Chính T.
Publicado: (2025)