scientific article; zbMATH DE number 2079894
From MaRDI portal
Publication:4472034
zbMath1044.68780MaRDI QIDQ4472034
Publication date: 3 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2279/22790112.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (16)
Phased local search for the maximum clique problem ⋮ A review on algorithms for maximum clique problems ⋮ Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ An adaptive multistart tabu search approach to solve the maximum clique problem ⋮ Solving maximum clique problem using chemical reaction optimization ⋮ Combinatorial algorithms for the maximum \(k\)-plex problem ⋮ Improvements to MCS algorithm for the maximum clique problem ⋮ Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling ⋮ The generalized independent set problem: polyhedral analysis and solution approaches ⋮ Speeding up branch and bound algorithms for solving the maximum clique problem ⋮ Finding quasi core with simulated stacked neural networks ⋮ A hybrid heuristic for the maximum clique problem ⋮ A study of ACO capabilities for solving the maximum clique problem ⋮ Mining relevant information on the Web: a clique-based approach ⋮ An effective local search for the maximum clique problem ⋮ New heuristic approaches for maximum balanced biclique problem
Uses Software
This page was built for publication:
