Name
Abstract | ||
|---|---|---|
•Cohesive subgroups can be quickly identified in much larger graphs.•An iterative approach gradually reduces complexity of graph.•New algorithm developed to quickly find 3-vertex separators.•Software builds on implementation of existing primitive operations.•Framework allows integration of faster algorithms for sub-steps. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1016/j.jocs.2016.10.005 | Journal of Computational Science |
Keywords | Field | DocType |
Graph algorithm,Social network,Cohesive subgroup,Vertex separator | Cohesion (chemistry),Discrete mathematics,Standard algorithms,Biconnected component,Vertex (geometry),Computer science,Biconnected graph,Vertex (graph theory),Theoretical computer science,Robustness (computer science),Vertex separator | Journal |
Volume | Issue | ISSN |
17 | Pt 1 | 1877-7503 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Robert S Sinkovits | 1 | 72 | 12.01 |
| James Moody | 2 | 97 | 12.12 |
| Bahattin Tolga Oztan | 3 | 0 | 0.34 |
| Douglas R. White | 4 | 18 | 4.90 |