Results 21 to 30 of about 7,486,633 (332)
Exact Algorithms for Biclique Coloring
Matemática Contemporânea, 2022 Summary: A \(k\)-biclique-coloring of \(G\) is \(k\)-coloring of the vertices of \(G\) with no maximal monochromatic biclique. A recent work showed that determining if such a coloring exists is \(\Sigma_2^{\mathsf{P}}\)-complete for \(k>2\). We present algorithms to determine if a graph has a \(k\)-biclique-coloring: an \(\mathcal{O}^\ast(4^n)\)-time ...
Guilherme Gomes +2 more
openaire +2 more sources
Exact Algorithms for Terrain Guarding [PDF]
ACM Transactions on Algorithms, 2018 Given a 1.5-dimensional terrain T , also known as an x -monotone polygonal chain, the T errain G uarding problem seeks a set of points of minimum size on T that guards all of the points on
Ashok, Pradeesha +4 more
openaire +3 more sources
An exact algorithm for the generalized list T-coloring problem [PDF]
Discrete Mathematics & Theoretical Computer Science, 2014 Discrete ...
Konstanty Junosza-Szaniawski +1 more
doaj +1 more source
Mathematics, 2020 We propose a novel linear time algorithm which, given any directed weighted graphs a and b with vertex degrees 1 or 2, constructs a sequence of operations transforming a into b.
Konstantin Gorbunov, Vassily Lyubetsky
doaj +1 more source
Exact Local Bosonic Algorithm for Dynamical Quarks [PDF]
, 1996 We present an exact local bosonic algorithm for the simulation of dynamical fermions in lattice QCD. We show that this algorithm is a viable alternative to the Hybrid Monte Carlo algorithm.Comment: 3 pages, 1 PostScript figure; Talk presented at ...
A. Galli +9 more
core +2 more sources
New algorithms for Exact Satisfiability
Theoretical Computer Science, 2003 The Exact Satisfiability problem is to determine if a CNF-formula has a truth assignment satisfying exactly one literal in each clause; Exact 3-Satisfiability is the version in which each clause contains at most three literals. In this paper, we present algorithms for Exact Satisfiability and Exact 3-Satisfiability running in time O(2^{0.2325n}) and O ...
Madsen, Bolette Ammitzbøll +2 more
openaire +5 more sources
Independent Exact Permutation Testing Algorithm for Distinguishing Sequential Pattern Discovery [PDF]
Jisuanji gongcheng, 2021 Traditional distinguishing sequential pattern mining algorithms usually generate a number of false positive patterns in their results, which hinder the subsequent decisions of tasks.
WU Jun, OUYANG Aijia, ZHANG Lin
doaj +1 more source
A Short Path Quantum Algorithm for Exact Optimization [PDF]
Quantum, 2018 We give a quantum algorithm to exactly solve certain problems in combinatorial optimization, including weighted MAX-2-SAT as well as problems where the objective function is a weighted sum of products of Ising variables, all terms of the same degree $D$;
M. B. Hastings
doaj +1 more source
Polynomial-time Computation of Exact Correlated Equilibrium in Compact Games [PDF]
, 2010 In a landmark paper, Papadimitriou and Roughgarden described a polynomial-time algorithm ("Ellipsoid Against Hope") for computing sample correlated equilibria of concisely-represented games.
Jiang, Albert Xin, Leyton-Brown, Kevin
core +3 more sources