scientific article
From MaRDI portal
Publication:2768314
zbMath1113.68416MaRDI QIDQ2768314
Publication date: 30 January 2002
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Improved exact algorithms for MAX-SAT, MP or not MP: that is the question, It is tough to be a plumber, Improved worst-case complexity for the MIN 3-SET COVERING problem, Colorings with few colors: counting, enumeration and combinatorial bounds, Computing optimal Steiner trees in polynomial space, Algorithms for four variants of the exact satisfiability problem, Vertex coloring of a graph for memory constrained scenarios, An O *(1.0977 n ) Exact Algorithm for max independent set in Sparse Graphs, The Time Complexity of Constraint Satisfaction, Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms, Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation, Dominating set based exact algorithms for \(3\)-coloring, A note on the complexity of minimum dominating set, Constructive generation of very hard 3-colorability instances, An exact algorithm for the channel assignment problem, Enumerating maximal independent sets with applications to graph colouring., On the number of maximal bipartite subgraphs of a graph, Approximation of min coloring by moderately exponential algorithms, Colorings with Few Colors: Counting, Enumeration and Combinatorial Bounds, An exact exponential branch-and-merge algorithm for the single machine total tardiness problem, Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems, Efficiency in exponential time for domination-type problems, Solving NP-Complete Problems with Quantum Search, Locally consistent constraint satisfaction problems
