Awesome q2a theme
0 votes

1) Suppose you’re a consultant for the networking company CluNet, and they have the following problem. The network that they’re currently working on is modelled by a connected graph G=(V,E) with n nodes. Each edge e is a fibre-optic cable that is owned by one of the companies –named X and Y and leashed to CluNet.

Their plan is to choose a spanning tree T of G and upgrade the links corresponding to the edges of T. Their business relations people have already concluded an agreement with the companies, X and Y stipulating a number k so that in the tree T that is chosen, k of the edges will be owned by X and n-k-1 of the edges will be owned by Y.

Give a polynomial time algorithm, that takes G, with each edge labelled X or Y, and either (i) returns a spanning tree with exactly k edges labelled X, or (ii) reports correctly that no such tree exists.

in Algorithms by (7 points) | 15 views

Please log in or register to answer this question.

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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Feb 2020
  1. shashin

    363 Points

  2. Shaik Masthan

    79 Points

  3. SuvasishDutta

    39 Points

  4. srestha

    33 Points

  5. Mk Utkarsh

    32 Points

  6. neeraj_bhatt

    31 Points

  7. !KARAN

    30 Points

  8. Debapaul

    23 Points

  9. Pratyush Priyam Kuan

    18 Points

  10. kalra05

    18 Points

Monthly Top User and those within 60% of his/her points will get a share of monthly revenue of GO subject to a minimum payout of Rs. 500. Current monthly budget for Top Users is Rs. 75.
3,327 questions
1,581 answers
89,915 users