WikiCards
Play on iPhone nowFree in Safari. Add it to your Home Screen.Play
WikiCards · Card list · Science cards · Clique problem
Uncommon card · Science
Clique problem, an Uncommon card
In computer science, the clique problem is the computational problem of finding cliques in a graph.
- Rarity
- Uncommon
- Domain
- Science
- ATK
- 83
- DEF
- 82
- Power
- 165
- Wikipedia reads a year
- 30,000
Power 165 (ATK + DEF): stronger than 85 % of WikiCards cards.
Clique problem quiz: 3 questions
Three questions on the Clique problem card, the way WikiCards duels ask them. Pick an answer, the facts are just below.
Find the missing word
The clique problem arises in the following real-world ______.
Answer
setting. The clique problem arises in the following real-world setting. From the Clique problem article on Wikipedia.
Which of these cards hits hardest (highest ATK)?
Answer
Timeline of the COVID-19 pandemic in August 2020. Timeline of the COVID-19 pandemic in August 2020 89 · Clique problem 83 · Ursa Minor 77 · Chromesthesia 72 ATK in WikiCards.
Which of these Wikipedia articles is read the most in a year?
Answer
Ursa Minor. Ursa Minor 140,000 · Chromesthesia 90,000 · Geomorphology 58,000 · Clique problem 30,000 Wikipedia reads over a year.
In a duel, each round asks a question like these about the opposing card, with 15 seconds to answer.
The facts on the card
The card carries these facts from its Wikipedia article.
- It has several different formulations depending on which cliques, and what information about the cliques, should be found.
- Common formulations of the clique problem include finding a maximum clique, finding a maximum weight clique in a weighted graph, listing all maximal cliques, and solving the decision problem of testing whether a graph contains a clique larger than a given size.
- The clique problem arises in the following real-world setting.
Why it is Uncommon
Rarity in WikiCards follows a year of Wikipedia page views: the most read articles become Epic and Legendary cards. The Clique problem article was read about 30,000 times in a year. ATK comes from the length of the article and DEF from its quality, so this card hits with 83 and blocks with 82: each hit it takes is cut by 33 %.
How to get Clique problem
Open packs. Each pack holds five cards drawn from real Wikipedia articles, the rarest last, and the fifth card is always Rare or better. The odds are shown in the game. A free pack arrives every hour and two can wait, and the Coins you win in duels buy more packs.
More Science cards
Cards close in power
The cards just above and just below Clique problem in the power ranking, all domains together.
- Yogyakarta International AirportUncommon · Society · ATK 74 DEF 91
- Battle of the NekUncommon · History · ATK 74 DEF 91
- Grand Isle, LouisianaUncommon · Society · ATK 77 DEF 88
- DjennéUncommon · Society · ATK 78 DEF 87
- Blue LineUncommon · Society · ATK 84 DEF 81
- Academic freedomUncommon · Society · ATK 87 DEF 78
Card lists
- Wikipedia quizNew questions every day
- All cards from A to ZEvery card, by name
- Science cards
- Legendary cards
- Tier listS and A tiers by power (ATK + DEF)
Credits
Text : Wikipedia, Clique problem (revision), CC BY-SA 4.0. Photo : Thore Husfeldt, CC BY-SA 3.0, Wikimedia Commons.
