@inproceedings{feb87fe50f7c4c5196dddc1d37d779f1,

title = "Finding induced subgraphs in scale-free inhomogeneous random graphs",

abstract = "We study the induced subgraph isomorphism problem on inhomogeneous random graphs with infinite variance power-law degrees. We provide a fast algorithm that determines for any connected graph H on k vertices if it exists as induced subgraph in a random graph with n vertices. By exploiting the scale-free graph structure, the algorithm runs in O(nk) time for small values of k. We test our algorithm on several real-world data sets.",

author = "Ellen Cardinaels and {van Leeuwaarden}, {Johan S.H.} and Clara Stegehuis",

year = "2018",

month = jan,

day = "1",

doi = "10.1007/978-3-319-92871-5_1",

language = "English",

isbn = "978-3-319-92870-8",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "1--15",

editor = "A. Bonato and P. Pralat and A. Raigorodskii",

booktitle = "Algorithms and Models for the Web Graph",

address = "Germany",

note = "15th Workshop on Algorithms and Models for the Web Graph, WAW 2018 ; Conference date: 17-05-2018 Through 18-05-2018",

}