Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (Q1719617)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments |
scientific article |
Statements
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: theory and experiments (English)
0 references
11 February 2019
0 references
combinatorial optimization
0 references
fixed-parameter tractability
0 references
small-diameter subgraphs
0 references
graph mining
0 references
community detection
0 references
0 references
0 references
0.88838094
0 references
0.8753202
0 references
0.8753202
0 references
0.8715284
0 references
0.8649759
0 references
0.86484325
0 references
0.8643542
0 references
0.86435413
0 references
0.8612808
0 references
0.86124885
0 references
