WikiCards
Play on iPhone nowFree in Safari. Add it to your Home Screen.Play
WikiCards · Card list · Science cards · Graph isomorphism problem
Uncommon card · Science
Graph isomorphism problem, an Uncommon card
The graph isomorphism problem is the computational problem of determining whether two finite graphs are isomorphic.
- Rarity
- Uncommon
- Domain
- Science
- ATK
- 74
- DEF
- 64
- Power
- 138
- Wikipedia reads a year
- 21,000
Power 138 (ATK + DEF): stronger than 70 % of WikiCards cards.
Graph isomorphism problem quiz: 3 questions
Three questions on the Graph isomorphism problem card, the way WikiCards duels ask them. Pick an answer, the facts are just below.
Which of these cards hits hardest (highest ATK)?
Answer
John Lomax. John Lomax 77 · Graph isomorphism problem 74 · Dwarf galaxy 70 · Thermohaline circulation 67 ATK in WikiCards.
Which of these Wikipedia articles is read the most in a year?
Answer
Thermohaline circulation. Thermohaline circulation 55,000 · Dwarf galaxy 40,000 · Graph isomorphism problem 21,000 · Atmospheric chemistry 15,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.
- The problem is not known to be solvable in polynomial time nor to be NP-complete, and therefore may be in the computational complexity class NP-intermediate.
- It is known that the graph isomorphism problem is in the low hierarchy of class NP, which implies that it is not NP-complete unless the polynomial time hierarchy collapses to its second level.
- At the same time, isomorphism for many special classes of graphs can be solved in polynomial time, and in practice graph isomorphism can often be solved efficiently.
Why it is Uncommon
Rarity in WikiCards follows a year of Wikipedia page views: the most read articles become Epic and Legendary cards. The Graph isomorphism problem article was read about 21,000 times in a year. ATK comes from the length of the article and DEF from its quality, so this card hits with 74 and blocks with 64: each hit it takes is cut by 26 %.
How to get Graph isomorphism 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 Graph isomorphism problem in the power ranking, all domains together.
- Zeb SoanesUncommon · Society · ATK 70 DEF 68
- Ross, CaliforniaUncommon · Society · ATK 67 DEF 71
- Ayeyarwady RegionUncommon · Society · ATK 70 DEF 68
- Game Boy PrinterUncommon · Science · ATK 70 DEF 68
- Spanish literatureUncommon · Science · ATK 79 DEF 59
- Surface acoustic waveUncommon · Science · ATK 72 DEF 66
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, Graph isomorphism problem (revision), CC BY-SA 4.0. Photo : BagLuke, CC0, Wikimedia Commons.
