Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 156 views

    Clique Problem

    Uploaded by

    Aman Gupta
    The Clique problem is defined as finding a complete subgraph (clique) of maximum size in an undirected graph. It is proven to be NP-complete by showing: 1) 3CNF ≤ρ Clique (3CNF reduces to Clique in polynomial time) 2) Clique ≤ρ 3CNF (Clique reduces to 3CNF in polynomial time) 3) Clique is in NP since it can be verified in polynomial time if a proposed clique of a given size is valid.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd

    Clique Problem

    Uploaded by

    Aman Gupta
    156 views10 pages
    The Clique problem is defined as finding a complete subgraph (clique) of maximum size in an undirected graph. It is proven to be NP-complete by showing: 1) 3CNF ≤ρ Clique (3CNF reduces to Clique in polynomial time) 2) Clique ≤ρ 3CNF (Clique reduces to 3CNF in polynomial time) 3) Clique is in NP since it can be verified in polynomial time if a proposed clique of a given size is valid.

    Original Title

    Clique Problem PPT

    Copyright

    © © All Rights Reserved

    Available Formats

    PPTX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The Clique problem is defined as finding a complete subgraph (clique) of maximum size in an undirected graph. It is proven to be NP-complete by showing: 1) 3CNF ≤ρ Clique (3CNF reduces to Clique in polynomial time) 2) Clique ≤ρ 3CNF (Clique reduces to 3CNF in polynomial time) 3) Clique is in NP since it can be verified in polynomial time if a proposed clique of a given size is valid.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    156 views10 pages

    Clique Problem

    Uploaded by

    Aman Gupta
    The Clique problem is defined as finding a complete subgraph (clique) of maximum size in an undirected graph. It is proven to be NP-complete by showing: 1) 3CNF ≤ρ Clique (3CNF reduces to Clique in polynomial time) 2) Clique ≤ρ 3CNF (Clique reduces to 3CNF in polynomial time) 3) Clique is in NP since it can be verified in polynomial time if a proposed clique of a given size is valid.

    Copyright:

    © All Rights Reserved
    Download as PPTX, PDF, TXT or read online from Scribd
    Download as pptx, pdf, or txt
    of 10

    CLIQUE PROBLEM

    In Clique, every vertex is directly connected to


    Definition another vertex, and the number of vertices in
    the Clique represents the Size of Clique.
    The following figure shows a graph that has a clique cover of size 3.
    For this you have to satisfy the following
    below-mentioned points: -
    To Prove: -
    Clique is an • 3CNF ≤ρ Clique
    NPC or not? • Clique ≤ρ 3CNF≤SAT
    • Clique ϵ NP
    3CNF ≤ρ Clique

    • Proof:-For the successful conversion from 3CNF to Clique, you have to


    follow the two steps:-
    • Draw the clause in the form of vertices, and each vertex represents the
    literals of the clauses.
    • They do not complement each other
    • They don't belong to the same clause
    In the conversion, the size of the Clique and size of 3CNF must be the
    same, and you successfully converted 3CNF into Clique within the
    polynomial time
    F = ( X + Y )  ( X' + Y')  ( X + Z)

                                                    X'         Y' 

                                  X                                                X

                                  Y                                                Z
    F = ( X + Y )  ( X' + Y')  ( X + Z)

                                                    X'         Y' 

                                 X                                                X

                                 Y                                                Z
    Clique ≤ρ 3CNF ≤ SAT
    • Proof: - As you know that a function of K clause, there must exist a Clique of size k. It means that
    P variables which are from the different clauses can assign the same value (say it is 1). By using
    these values of all the variables of the CLIQUES, you can make the value of each clause in the
    function is equal to 1

    • Example: - You have a Boolean function in 3CNF:-


    • (X+Y) (X'+Y') (X+Z)
    • After Reduction/Conversion from 3CNF to CLIQUE, you will get P variables such as: -
        Y = 1, X' =1 and Z = 1
    • Put the value of P variables in equation (i)
    • (0+1)(1+0)(0+1)
    • (1)(1)(1)=1 output verified
    • F = ( X + Y )  ( X' + Y')  ( X + Z)
    F = ( 0 + 1 )  ( 1 + 0)  ( 0 + 1)
    F = (1)  (1)  (1)
    F=1

                                                   X'          Y' 

                                 X                                                X

                                 Y                                                Z
    Clique ϵ NP:-
    • Proof: - As you know very well, you can get the Clique through 3CNF and to convert the
    decision-based NP problem into 3CNF you have to first convert into SAT and SAT comes
    from NP.

    So, concluded that CLIQUE belongs to NP.

    • Proof of NPC:-
    • Reduction achieved within the polynomial time from 3CNF to Clique
    • And verified the output after Reduction from Clique To 3CNF above
    So, concluded that, if both Reduction and verification can be done within the polynomial
    time that means Clique also in NPC.

    You might also like