Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

ขั้นตอนวิธีโบรน-เคอร์โบสท์ · Vinony

Home
Graph algorithms
ขั้นตอนวิธีโบรน-เคอร์โบสท์

🌐ไทย

English Français Русский ไทย 中文

EntityQ2031707· pop 6· linked from 8 articles

ขั้นตอนวิธีโบรน-เคอร์โบสท์

a recursive backtracking algorithm for finding maximal cliques in an undirected graph

Available in 6 languages

Français
Русский
Serbian
Ukrainian
ไทย

via Wikidata sitelinks · CC0

Connections

time complexity

Categories

Graph algorithms

Sources

wikipedia.externallinksexternallink

computer science

Entity

International Standard Book Number

digital object identifier

computational chemistry

list of algorithms

Mathematical Reviews

Sign in to save

What links here8 pages

community structure

maximal independent set

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

Entitydist 0.43

Entitydist 0.49

breadth-first search

Entitydist 0.51

Template:Graph traversal algorithms

Entitydist 0.52

Brouwer–Haemers graph

Entitydist 0.53

connected component of a graph

Entitydist 0.53

Barabási–Albert model

Entitydist 0.56

depth-first search

Entitydist 0.59

minimum spanning tree

Entitydist 0.59

graph data structure

Entitydist 0.60

Entitydist 0.61

graph-structured stack

Entitydist 0.62