Pages that link to "Item:Q2576439"
From MaRDI portal
The following pages link to Novel approaches for analyzing biological networks (Q2576439):
Displaying 16 items.
- An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
- Finding Disjoint Dense Clubs in an Undirected Graph (Q4632197) (← links)
- On Fault-Tolerant Low-Diameter Clusters in Graphs (Q5060794) (← links)
- Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs (Q5115768) (← links)
- Integer models and upper bounds for the 3‐club problem (Q5326766) (← links)
- Robustness and Strong Attack Tolerance of Low-Diameter Networks (Q5326889) (← links)
- Covering a Graph with Clubs (Q5377354) (← links)
- On the tractability of covering a graph with 2-clubs (Q5925691) (← links)
- On atomic cliques in temporal graphs (Q6043101) (← links)
- The parameterized complexity of \(s\)-club with triangle and seed constraints (Q6056631) (← links)
- Algorithms for 2-club cluster deletion problems using automated generation of branching rules (Q6140356) (← links)
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs (Q6145821) (← links)
- On the parameterized complexity of s-club cluster deletion problems (Q6165557) (← links)
- On the parameterized complexity of non-hereditary relaxations of clique (Q6549685) (← links)
- Efficient branch-and-bound algorithms for finding triangle-constrained 2-clubs (Q6646734) (← links)
- Finding conserved low-diameter subgraphs in social and biological networks (Q6659091) (← links)
