Conference
Cited 0 time in 
Cited 0 time in 
Cited 0 time in
Metadata Downloads
Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | OH, EUNJIN | - |
| dc.contributor.author | Oh, Seunghyeok | - |
| dc.date.accessioned | 2024-01-23T00:27:13Z | - |
| dc.date.available | 2024-01-23T00:27:13Z | - |
| dc.date.created | 2023-12-11 | - |
| dc.date.issued | 2023-09-05 | - |
| dc.identifier.uri | https://oasis.postech.ac.kr/handle/2014.oak/119827 | - |
| dc.description.abstract | In this paper, we study the maximum clique problem on hyperbolic random graphs. A hyperbolic random graph is a mathematical model for analyzing scale-free networks since it effectively explains the power-law degree distribution of scale-free networks. We propose a simple algorithm for finding a maximum clique in hyperbolic random graph. We first analyze the running time of our algorithm theoretically. We can compute a maximum clique on a hyperbolic random graph G in O(m+n | - |
| dc.language | English | - |
| dc.publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing | - |
| dc.relation.isPartOf | 31st Annual European Symposium on Algorithms, ESA 2023 | - |
| dc.relation.isPartOf | Leibniz International Proceedings in Informatics, LIPIcs | - |
| dc.title | Algorithms for Computing Maximum Cliques in Hyperbolic Random Graphs | - |
| dc.type | Conference | - |
| dc.type.rims | CONF | - |
| dc.identifier.bibliographicCitation | 31st Annual European Symposium on Algorithms, ESA 2023 | - |
| dc.citation.conferenceDate | 2023-09-04 | - |
| dc.citation.conferencePlace | NL | - |
| dc.citation.title | 31st Annual European Symposium on Algorithms, ESA 2023 | - |
| dc.contributor.affiliatedAuthor | OH, EUNJIN | - |
| dc.description.journalClass | 1 | - |
| dc.description.journalClass | 1 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.