How Randomized Search Heuristics Find Maximum Cliques in Planar Graphs

doi 10.1145/1143997.1144099
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Ordered Graphs and Large Bi-Cliques in Intersection Graphs of Curves

European Journal of Combinatorics
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTheoretical Computer ScienceTopology
2019English

Restart and Random Walk in Local Search for Maximum Vertex Weight Cliques With Evaluations in Clustering Aggregation

2017English

Expected Fitness Gains of Randomized Search Heuristics for the Traveling Salesperson Problem

Evolutionary Computation
Computational Mathematics
2017English

Planar and Non-Planar Graphs

International Journal of Modern Trends in Engineering & Research
2017English

An Approach to Determination of Maximal Cliques in Undirected Graphs

International Journal of Modern Education and Computer Science
2018English

Cliques in Regular Graphs and the Core-Periphery Problem in Social Networks

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Maximum Flow in Planar Networks

SIAM Journal on Computing
MathematicsComputer Science
1979English

New Heuristics for the Maximum Diversity Problem

Journal of Heuristics
ControlInformation SystemsManagement ScienceComputer NetworksCommunicationsOptimizationOperations ResearchArtificial IntelligenceSoftware
2007English

Intuitionistic Fuzzy Planar Graphs

Discrete Dynamics in Nature and Society
ModelingSimulation
2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy