Vertex removal graph problem with minimization constraint
0 Answers
Vertex removal graph problem with minimization constraint
| Flag | PURGE
There is a graph in which each vertex has an associated cost and a label that is binary (0 or 1). You need to remove vertices from the graph such that none of the remaining edges in the graph connect vertices with the same label.
Constraint: minimize the total cost of vertices removed.
Email me when people comment.
Email me when people comment.
Loading...
An error occurred in subscribing you.
Email me when people comment.
Email me when people comment.
Loading...
An error occurred in subscribing you.
CareerCup is the world's biggest and best source for software engineering interview preparation. See all our resources.