On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function

On approximate graph colouring and MAX−k−CUT algorithms based on the ϑ−function

Bibliographic Details
Main Authors:	de Klerk, E, Pasechnik, D, Warners, J
Format:	Journal article
Published:	2004

Similar Items

On approximate graph colouring and max-k-cut algorithms based on the θ-function
by: Klerk, Etienne de., et al.
Published: (2013)

On the Lovász ϑ-number of almost regular graphs with application to Erdős–Rényi graphs
by: Sotirov, R., et al.
Published: (2012)

An Improved Approximation Algorithm for Quantum Max-Cut on Triangle-Free Graphs
by: Robbie King
Published: (2023-11-01)

Approximation of the stability number of a graph via copositive programming
by: de Klerk, E, et al.
Published: (2002)

Improvement of Quantum Approximate Optimization Algorithm for Max–Cut Problems
by: Javier Villalba-Diez, et al.
Published: (2021-12-01)

Approximate graph colouring and crystals
by: Ciardo, L, et al.
Published: (2023)

Approximate graph colouring and the hollow shadow
by: Zivny, S, et al.
Published: (2023)

Approximate θ-multipliers on Banach algebras
by: Abbas Zivari-Kazempour
Published: (2022-02-01)

On the max-cut of sparse random graphs
by: Gamarnik, David, et al.
Published: (2019)

Graph cuts with interacting edge weights: examples, approximations, and algorithms
by: Bilmes, Jeff A., et al.
Published: (2017)

Bounds on approximating Max $k$XOR with quantum and classical local algorithms
by: Kunal Marwaha, et al.
Published: (2022-07-01)

Max k-cut and judicious k-partitions
by: Bollobas, B, et al.
Published: (2010)

Approximation algorithms for multi-multiway cut and multicut problems on directed graphs
by: Ramin Yarinezhad, et al.
Published: (2020-09-01)

Clustering Improves the Goemans–Williamson Approximation for the Max-Cut Problem
by: Angel E. Rodriguez-Fernandez, et al.
Published: (2020-08-01)

An Almost-Linear-Time Algorithm for Approximate Max Flow in Undirected Graphs, and its Multicommodity Generalizations
by: Lee, Yin Tat, et al.
Published: (2015)

On α-strongly θ-continuity, αθ-openness and (α, θ)-closed graphs in Topological Spaces
by: Abdullah Abdul-Jabbar
Published: (2007-07-01)

On θ-commutators and the corresponding non-commuting graphs
by: Shalchi S., et al.
Published: (2017-12-01)

A note on the stability number of an orthogonality graph
by: de Klerk, E, et al.
Published: (2007)

Max Cut for Random Graphs with a Planted Partition
by: Bollobás, B, et al.
Published: (2004)

Truly Scalable K-Truss and Max-Truss Algorithms for Community Detection in Graphs
by: Alessio Conte, et al.
Published: (2020-01-01)

On the Lovász theta−number of almost regular graphs with application to Erdös−Rényi graphs
by: Klerk, E, et al.
Published: (2009)

Book drawings of complete bipartite graphs
by: de Klerk, E, et al.
Published: (2014)

Local classical MAX-CUT algorithm outperforms $p=2$ QAOA on high-girth regular graphs
by: Kunal Marwaha
Published: (2021-04-01)

Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
by: Karger, David R., et al.
Published: (2015)

Food for /θɔt/ or /θɑt/?
by: Rosa Balliro
Published: (2021-12-01)

On functionally θ-normal spaces
by: J.K. Kohli, et al.
Published: (2005-04-01)

Algorithms for Approximate Graph Coloring
by: Blum, Avrim
Published: (2023)

θp(Λ, p)-Open Functions and θp(Λ, p)-Closed Functions
by: Chawalit Boonpok, et al.
Published: (2023-12-01)

Improved lower bounds for book crossing numbers of complete graphs
by: de Klerk, E, et al.
Published: (2013)

A Study of $k$-dipath Colourings of Oriented Graphs
by: Christopher Duffy, et al.
Published: (2018-02-01)

A note on the stability number of an orthogonality graph
by: Klerk, Etienne de., et al.
Published: (2011)

Approximating Max Function in Fully Homomorphic Encryption
by: Hyunjun Lee, et al.
Published: (2023-04-01)

(θ1,θ2) - Derivation Pair on Rings
by: Mohammed Khalid Shahoodh
Published: (2022-04-01)

Edge-dominating cycles, k-walks and Hamilton prisms in 2K2-free graphs
by: Mou, G, et al.
Published: (2016)

Graphs, colourings and the four-colour theorem /
by: 374980 Wilson, Robert A.
Published: (2002)

Exact and approximate inference in associative hierarchical networks using graph cuts
by: Russell, C, et al.
Published: (2010)

BDD-Based Algorithm for SCC Decomposition of Edge-Coloured Graphs
by: Nikola Beneš, et al.
Published: (2022-03-01)

Optimal Coloring Strategies for the Max <i>k</i>-Cut Game
by: Andrea Garuglieri, et al.
Published: (2024-02-01)

A special case of rational θs for terminating θ-expansions
by: Santanu Chaktaborty
Published: (2013-12-01)

Sobre los continuos tipo θ y θn
by: Sergio Macías
Published: (2015-05-01)