Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Cormen 3rd edition chapter 22 question: 22.4.4
Abhilash Mishra
asked
in
Algorithms
Jul 4, 2018
recategorized
Jul 6, 2022
by
Lakshman Patel RJIT
364
views
1
vote
1
vote
Prove or disprove: If a directed graph G contains cycles, then TOPOLOGICAL SORT $(G)$ produces a vertex ordering that minimizes the number of “bad” edges that are inconsistent with the ordering produced.
algorithms
graph-theory
graph-algorithms
topological-sort
Abhilash Mishra
asked
in
Algorithms
Jul 4, 2018
recategorized
Jul 6, 2022
by
Lakshman Patel RJIT
by
Abhilash Mishra
364
views
answer
comment
Follow
share this
share
0 Comments
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
0
Answers
← Previous
Next →
← Previous in category
Next in category →
Related questions
0
votes
0
votes
0
answers
1
Lakshman Patel RJIT
asked
in
Algorithms
Jan 5, 2019
126
views
UPPCL AE 2018:56
The Adjacency matrix of a directed graph $\text{G}$ ... $(h, c, a, e, f, d, i, g, b)$ $(c, a, d, e, f, g, h, i, b)$
Lakshman Patel RJIT
asked
in
Algorithms
Jan 5, 2019
by
Lakshman Patel RJIT
126
views
uppcl2018
algorithms
graph-algorithms
topological-sort
3
votes
3
votes
5
answers
2
Vasu_gate2017
asked
in
Algorithms
Jan 23, 2017
1,389
views
MadeEasy CBT 2017: Algorithms - Graph Algorithms
No of topological sortings
Vasu_gate2017
asked
in
Algorithms
Jan 23, 2017
by
Vasu_gate2017
1.4k
views
made-easy-test-series
cbt-2017
algorithms
graph-algorithms
topological-sort
1
vote
1
vote
0
answers
3
aambazinga
asked
in
Algorithms
Aug 19, 2018
966
views
CLRS INTRODUCTION TO ALGORITHMS 3rd Edition, CHAPTER 23 QUESTION 23.2.7
suppose that a graph G has MST already computed. How quickly can we update the MST if we add a new vertex and incident edges to it. I know for the best case scenario when a single edge is incident from the ... up being linear time since we can reuse part of the DFS that we had already computed before detecting each cycle.
aambazinga
asked
in
Algorithms
Aug 19, 2018
by
aambazinga
966
views
algorithms
graph-algorithms
prims-algorithm
2
votes
2
votes
1
answer
4
Veeplob Singh
asked
in
Algorithms
Jul 22, 2017
502
views
Cormen 3rd edition (Chapter 4 Divide & Conquer)
Refer Cormen 4-3 (j) Page no108 Give Asymptotic upper bound of given recurrence using "SUBSTITUTION METHOD" T(n)=n^(1/2) .T(n^(1/2)) +n
Veeplob Singh
asked
in
Algorithms
Jul 22, 2017
by
Veeplob Singh
502
views
algorithms
recurrence-relation
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
What are the key things to focus on during the final 10-15 days before the GATE exam to improve performance?
All India GO Classes Mock test
NTA UGC NET JRF December 2022 Apply Online Form 2023
Life happens, just chill and do hardwork
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.8k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
@mahendrapatel
Initially go classes planned on saturdays but...
@Lakshman Patel RJIT Thank you Sir for this...
why go all india live tests are colliding with...
Great work
Twitter
WhatsApp
Facebook
Reddit
LinkedIn
Email
Link Copied!
Copy