Find the maximum clique by graph coloring using heuristic greedy

QR Code

Find the maximum clique by graph coloring using heuristic greedy

Bibliographic Details
Format:	Restricted Document

Similar Items

Branch and bound algorithm for finding the maximum clique problem

An enumerative algorithm for the maximum clique problem

On self-clique graphs / Ong Poh Hwa
by: Ong, Poh Hwa
Published: (2010)

Solution of maximum clique problem by using branch and bound method

Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem
by: Fayaz, Muhammad, et al.
Published: (2018)

Greedy heuristic for the workforce scheduling and routing problem
by: Russell, Samuel
Published: (2017)

Crystal Clique
by: Parfitt, Mark
Published: (2016)

Planar Graphs And Coloring
by: Manogaran, Lavaneesvari
Published: (2010)

A greedy heuristic for workforce scheduling and routing with time-dependent activities constraints
by: Castillo-Salazar, J. Arturo, et al.
Published: (2015)

Graph algorithm vertex coloring

Greedy feature construction
by: Oglic, Dino, et al.
Published: (2016)

On the study of rainbow antimagic coloring of special graphs
by: Dafik, Dafik, et al.
Published: (2023)

Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python
by: Arifin, Samsul, et al.
Published: (2022)

A greedy technique for finding the most reliable edge-disjoint-path-set in a network.
by: Loh, Rue-chze, et al.
Published: (2008)

Hybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems
by: Burke, Edmund, et al.
Published: (2005)

A graph-based hyper heuristic for timetabling problems
by: Burke, Edmund, et al.
Published: (2007)

A graph-based hyper heuristic for timetabling problems
by: Burke, Edmund, et al.
Published: (2007)

Alpha Clique Sdn. Bhd. / Nurul Hidayah Mohd Kamal
by: Mohd Kamal, Nurul Hidayah
Published: (2020)

Maximum and minimum degree energy of commuting graph for dihedral groups
by: Romdhini, Mamika Ujianita, et al.
Published: (2022)

Maximum and minimum degree energy of commuting graph for dihedral groups
by: Romdhini, Mamika Ujianita, et al.
Published: (2022)

Graph theoretic based heuristics for the facility layout design problem
by: Kusumah, Yaya S,
Published: (2001)

A grouping hyper-heuristic framework: application on graph colouring
by: Elhag, Anas, et al.
Published: (2015)

Optimizing kindergarten schedule using : graph coloring / Nur Nabilah Salleh Muner
by: Salleh Muner, Nur Nabilah
Published: (2019)

SAR Image Classification Using Multifractal Using Dimensions and Binary Cliques Iterative Decomposition Method
by: Teng, Hse Tzia
Published: (2009)

Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling
by: Mohammad Pour, Shahrzad
Published: (2009)

Simulation study of a heuristic near-maximum ant-based dynamic routing
by: Tan, Chin, et al.
Published: (2008)

Simulation study of a heuristic near-maximum ant-based dynamic routing
by: Tan, Chin, et al.
Published: (2008)

Performance analyses of graph heuristics and selected trajectory metaheuristics on examination timetable problem
by: Mandal, Ashis Kumar, et al.
Published: (2020)

Hybridizations within a graph based hyper-heuristic framework for university timetabling problems
by: Qu, Rong, et al.
Published: (2008)

Linear-time heuristic partitioning technique for mapping of connected graphs into single-row networks
by: Ser, Lee Loh, et al.
Published: (2014)

The implementation of partial graph heuristic with improvement method to solve the UMP examination timetabling problem
by: Lee Jian, Hao
Published: (2013)

The graph heuristic with great deluge algorithm to solve the ITC2007 examination timetabling problem
by: Chuan, Wei Kiat
Published: (2014)

Combination of Graph Heuristic with Hill Climbing Search for Solving Capacitated Examination Timetabling Problem
by: Ashis Kumar, Mandal, et al.
Published: (2015)

Routing problem in rectangular mesh network using Dijkstra’s based Greedy method
by: Noraziah, Adzhar, et al.
Published: (2018)

Battening Down / Greedy after this gossip / The town and river overflow
by: Kinsella, John
Published: (2011)

Top-down Heuristic for Finding Optimal Grain Size of Parallel Tasks
by: Mohd Saman, Md. Yazid, et al.
Published: (1995)

A heuristic approach for finding similarity indexes of multivariate data sets
by: Khan, Rahim, et al.
Published: (2020)

Routing problem in rectangular mesh network using shortest path based Greedy method
by: Noraziah, Adzhar, et al.
Published: (2019)

Routing problem in rectangular mesh network using shortest path based Greedy method
by: Noraziah, Adzhar, et al.
Published: (2019)

Non-greedy minimum interference routing algorithm for bandwidth-guaranteed flows
by: Tan, Su Wei, et al.
Published: (2002)