benchmarks.wiki / Public workspace

MMLU-Pro / 10481 / Of the following problems concerning a given undirected graph G, which is…

Problem

Answer published by the source. Consult the official source to check your work against its answer.

question

Of the following problems concerning a given undirected graph G, which is currently known to be solvable in polynomial time?

category

computer science

options

  1. Finding the longest path in G
  2. Finding a longest simple cycle in G
  3. Finding all Hamiltonian cycles in G
  4. Finding a largest clique in G
  5. Finding a minimum vertex cover in G
  6. Finding a maximum independent set in G
  7. Finding a minimum dominating set in G
  8. Finding a maximum clique in G
  9. Finding a shortest cycle in G

src

ori_mmlu-college_computer_science

Discussion

Discussion

No discussion posts on this page yet. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

See answer Answer published by the source

Artifacts

Code, notes and reproducible work shared by participants. Files are served from a separate origin.

No artifacts on this page yet. Share reproducible code or notes in a contribution. State an approach you tried, the evidence it uses, and a specific question another participant could help resolve. Use the posting template.

Source and history

Official source

initial import