kCoresHypergraph         package:hypergraph         R Documentation

_F_i_n_d _a_l_l _t_h_e _k-_c_o_r_e_s _i_n _a _h_y_p_e_r_g_r_a_p_h

_D_e_s_c_r_i_p_t_i_o_n:

     Find all the k-cores in a hypergraph

_U_s_a_g_e:

     kCoresHypergraph(hg)

_A_r_g_u_m_e_n_t_s:

      hg: an instance of the 'Hypergraph' class 

_D_e_t_a_i_l_s:

     A k-core in a hypergraph is a maximal subhypergraph where (a) no
     hyperedge  is contained in another, and (b) each node is adjacent
     to at least 'k'  hyperedges in the subgraph.

     The implementation is based on the algorithm by E. Ramadan, A.
     Tarafdar, A. Pothen, 2004.

_V_a_l_u_e:

     A vector of the core numbers for all the nodes in 'g'.

_A_u_t_h_o_r(_s):

     Li Long <li.long@isb-sib.ch>

_R_e_f_e_r_e_n_c_e_s:

     A hypergraph model for the yeast protein complex network, 
     Ramadan, E.   Tarafdar, A.   Pothen, A., Parallel and Distributed
     Processing Symposium, 2004. Proceedings. 18th International.

_E_x_a_m_p_l_e_s:

     # to turn the snacoreex.gxl (from RBGL package) graph to a hypergraph
     # this is a rough example 
     kc_hg_n <- c("A", "C", "B", "E", "F", "D", "G", "H", "J", "K", "I", "L", "M", "N", "O", "P", "Q", "R", "S", "T", "U")
     kc_hg_e <- list(c("A", "C"), c("B", "C"), c("C", "E"), c("C", "F"), c("E", "D"), c("E", "F"), c("D", "G"), c("D", "H"), c("D", "J"), c("H", "G"), c("H", "J"), c("G", "J"), c("J", "M"), c("J", "K"), c("M", "K"), c("M", "O"), c("M", "N"), c("K", "N"), c("K", "F"), c("K", "I"), c("K", "L"), c("F", "I"), c("I", "L"), c("F", "L"), c("P", "Q"), c("Q", "R"), c("Q", "S"), c("R", "T"), c("S", "T"))
     kc_hg_he <- lapply(kc_hg_e, "Hyperedge")
     kc_hg <- new("Hypergraph", nodes=kc_hg_n, hyperedges=kc_hg_he)

     kCoresHypergraph(kc_hg)

