Computer Science · Algorithms
एक सामान्य ग्राफ़ (general graph) में, कौन सा मैचिंग एल्गोरिदम पॉलिनोमियल समय (polynomial time) में मैक्सिमम मैचिंग की गारंटी देता है?
Verified Solution4 OptionsUpdated: October 2026👁️1 View
Share:
- 1एडमंड्स ब्लॉसम एल्गोरिदम (Edmonds' Blossom Algorithm)✓
- 2क्रुस्कल्स एल्गोरिदम (Kruskal's Algorithm)
- 3प्रिम्स एल्गोरिदम (Prim's Algorithm)
- 4फॉर्ड-फुलकर्सन एल्गोरिदम (Ford-Fulkerson Algorithm)
सही उत्तर देखें
एडमंड्स ब्लॉसम एल्गोरिदम (Edmonds' Blossom Algorithm)
Download Single Question PDF
Save this question and verified answer as a clean study sheet with live clickable link.
👥
Share with Friends & Study Groups
Challenge your peer aspirants on WhatsApp or Telegram to solve this question!
Online Test Series
Start Free Mock Test →Preparing for Computer Science?
Practice full-length mock tests with real exam timers, instant score analysis, and all-India ranking.
Chapter Practice
Practice Algorithms MCQs →Want more practice questions on Algorithms?
Solve complete topic-wise tests with detailed solutions on GkGet.
Related Practice Questions
Recommended practice questions in Computer Science · Algorithms