Adapting the Bron-Kerbosch algorithm for enumerating maximal cliques in temporal graphs
Bibliographic Data
| ID | 4615751 |
|---|---|
| Authors | Anne-Sophie Himmel (Technische Universität Berlin), Hendrik Molter (0000-0002-4590-798X, Technische Universität Berlin), Rolf Niedermeier (0000-0003-1703-1236, Technische Universität Berlin), Manuel Sorge (0000-0001-7394-3147, Ben-Gurion University of the Negev) |
| Year | 2017 |
| Volume | 7 |
| Issue | 1 |
| Publication date | 2017-12-01 |
| Peer Reviewed | Yes |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Social Network Analysis and Mining (JOURNAL) |
| Journal identifiers | ISSN: 1869-5450 • E-ISSN: 1869-5469 |
| Publisher | Springer Science and Business Media LLC (PUBLISHER) |
| DOI | 10.1007/s13278-017-0455-0 |
| OpenAlex | W2610338003 |
| Language | EN |
| Citations received | 2 |
| References cited | 24 |
1-planar graph · Algorithm · Backtracking · Chordal graph · Clique · Combinatorics · Discrete mathematics · Graph · Running time · Split graph · Time complexity · Complex Network Analysis Techniques · Computer Science · Human Mobility and Location-Based Analysis · Mathematics · Opportunistic and Delay-Tolerant Networks · Theoretical Computer Science
| Unique citing works | 2 |
|---|---|
| Citations per year | 0,33 |
| Citation span | 2020 - 2024 (5) |
| Citation velocity | recent |
| Highly cited | No |
| Citation types | Neutral: 2 |