Help with this graph problem
Posted: Sat Feb 05, 2005 3:43 am
Input:
A connected graph G=(V,E), a number k (3*K<=|V|)
Problem:
Delete as small edges of G as possible such that after deleting, G has k connected-component, each component has at least 3 verticles
Please help me. Thanks
A connected graph G=(V,E), a number k (3*K<=|V|)
Problem:
Delete as small edges of G as possible such that after deleting, G has k connected-component, each component has at least 3 verticles
Please help me. Thanks