Program should work on any interval graph with the umbrella


My problem is to code a program in c++ or java for to find a minimum clique cover for the interval graph

input: input should be the text file with an adjacency list and its umbrella free ordering

output: the vertex sets of cliques forming a minimum clique cover.

below one is the input file format there n,m represents vertices and edges.

AFO: means umbrella free ordering.

that is not the input file to consider it is just a sample structure

1. program should work on any interval graph with the umbrella free ordering.

2. and it should produce the minimum clique cover. i have given the text file which is the sample one. you will take the interval graph in the format what i have given in the text file. the text file is for the reference. once the program was created and i will give the different interval graph it should work on it also.

Attachment:- test.txt

Request for Solution File

Ask an Expert for Answer!!
C/C++ Programming: Program should work on any interval graph with the umbrella
Reference No:- TGS01358152

Expected delivery within 24 Hours