- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Under what condition can a vertex combin...

Q. |
## Under what condition can a vertex combine and distribute flow in any manner? |

A. | it may violate edge capacities |

B. | it should maintain flow conservation |

C. | the vertex should be a source vertex |

D. | the vertex should be a sink vertex |

Answer» B. it should maintain flow conservation | |

Explanation: a vertex can combine and distribute flow in any manner but it should not violate edge capacities and it should maintain flow conservation. |

View all MCQs in:
Design and Analysis of Algorithms

- Which type of graph has all the vertex of the first set connected to all the vertex of the second set?
- In a bipartite graph G=(V,U,E), the matching of a free vertex in V to a free vertex in U is called?
- How many times the insert and extract min operations are invoked per vertex?
- Which theorem gives the relation between the minimum vertex cover and maximum matching?
- Under what condition any set A will be a subset of B?
- A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?
- Which graph has a size of minimum vertex cover equal to maximum matching?
- How many edges does a n vertex triangle free graph contains?
- The problem of finding a path in a graph that visits every vertex exactly once is called?
- The most important condition for which closest pair is calculated for the points (pi, pj) is?

Login to Continue

It will take less than 2 minutes

Report MCQ