Pages that link to "Item:Q1143177"

The following pages link to Clique detection for nondirected graphs: Two new algorithms (Q1143177):

Displaying 16 items.

• A new backtracking algorithm for generating the family of maximal independent sets of a graph (Q786833) (← links)
• Finding maximum cliques in arbitrary and in special graphs (Q807639) (← links)
• An exact algorithm for the maximum clique problem (Q922964) (← links)
• An algorithm for generating all maximal independent subsets of posets (Q1147517) (← links)
• A depth first search algorithm to generate the family of maximal independent sets of a graph lexicographically (Q1157909) (← links)
• The maximum clique problem (Q1318271) (← links)
• A multi-KP modeling for the maximum-clique problem (Q1328650) (← links)
• Enumerating all connected maximal common subgraphs in two graphs (Q1589412) (← links)
• A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees (Q1907945) (← links)
• Solving the maximum clique problem using a tabu search approach (Q2367014) (← links)
• An algorithm for finding a maximum weighted independent set in an arbitrary graph (Q3210915) (← links)
• A global optimization approach for solving the maximum clique problem (Q4009762) (← links)
• Using Fifth Generation Tools for Solving the Clique Number Problem (Q4712613) (← links)
• A branch and bound algorithm for the maximum clique problem (Q5899820) (← links)
• A branch and bound algorithm for the maximum clique problem (Q5905591) (← links)
• Finding all \(k\)-cliques in \(k\)-partite graphs, an application in textile engineering (Q5955469) (← links)