Pages that link to "Item:Q2368963"
From MaRDI portal
The following pages link to Efficiently covering complex networks with cliques of similar vertices (Q2368963):
Displaying 11 items.
- On the kernel size of clique cover reductions for random intersection graphs (Q491163) (← links)
- \(0\text{-}1\) multilinear programming as a unifying theory for LAD pattern generation (Q730482) (← links)
- Maximum cliques in graphs with small intersection number and random intersection graphs (Q826323) (← links)
- Isolation concepts for clique enumeration: comparison and computational experiments (Q1040581) (← links)
- Connectivity of the uniform random intersection graph (Q1044989) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Large-scale clique cover of real-world networks (Q2288213) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Known Algorithms for Edge Clique Cover are Probably Optimal (Q3464061) (← links)
- Enumerating Isolated Cliques in Synthetic and Financial Networks (Q5505678) (← links)
- Efficiently approximating vertex cover on scale-free networks with underlying hyperbolic geometry (Q6066757) (← links)
