Pages that link to "Item:Q5112249"

The following pages link to Finding Cliques in Social Networks: A New Distribution-Free Model (Q5112249):

Displaying 10 items.

• Detecting and enumerating small induced subgraphs in \(c\)-closed graphs (Q2043376) (← links)
• Exploiting $c$-Closure in Kernelization Algorithms for Graph Problems (Q5048305) (← links)
• Exploiting c-Closure in Kernelization Algorithms for Graph Problems (Q5874537) (← links)
• A Hierarchy of Network Models Giving Bistability Under Triadic Closure (Q5880624) (← links)
• (Q6065417) (← links)
• Further Exploiting <i>c</i>-Closure for FPT Algorithms and Kernels for Domination Problems (Q6071818) (← links)
• Essentially tight kernels for (weakly) closed graphs (Q6103524) (← links)
• Computing dense and sparse subgraphs of weakly closed graphs (Q6107896) (← links)
• The frustum network model based on clique extension (Q6645166) (← links)
• Switchover phenomenon for general graphs (Q6667590) (← links)