Pages that link to "Item:Q4202213"
From MaRDI portal
The following pages link to Parallel Complexity of the Connected Subgraph Problem (Q4202213):
Displayed 8 items.
- Finding maximum subgraphs with relatively large vertex connectivity (Q297249) (← links)
- The VC-dimension of graphs with respect to \(k\)-connected subgraphs (Q335348) (← links)
- On robust clusters of minimum cardinality in networks (Q513606) (← links)
- Community detection using local neighborhood in complex networks (Q1618664) (← links)
- Parallel approximation schemes for problems on planar graphs (Q1924999) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- A Glimpse at Paul G. Spirakis (Q3464465) (← links)
- The complexity of approximating PSPACE-complete problems for hierarchical specifications (Q4630250) (← links)