@inproceedings{DBLP:conf/pakdd/ChehreghaniBA18,
  author    = {Mostafa Haghir Chehreghani and
               Albert Bifet and
               Talel Abdessalem},
  title     = {Efficient Exact and Approximate Algorithms for Computing Betweenness
               Centrality in Directed Graphs},
  booktitle = {Advances in Knowledge Discovery and Data Mining - 22nd Pacific-Asia
               Conference, {PAKDD} 2018, Melbourne, VIC, Australia, June 3-6, 2018,
               Proceedings, Part {III}},
  pages     = {752--764},
  year      = {2018},
  crossref  = {DBLP:conf/pakdd/2018-3},
  url       = {https://doi.org/10.1007/978-3-319-93040-4\_59},
  doi       = {10.1007/978-3-319-93040-4\_59},
  timestamp = {Tue, 14 May 2019 10:00:51 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/pakdd/ChehreghaniBA18},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

{"_id":"oFyz3szzKtZmavzij","bibbaseid":"chehreghani-bifet-abdessalem-efficientexactandapproximatealgorithmsforcomputingbetweennesscentralityindirectedgraphs-2018","authorIDs":[],"author_short":["Chehreghani, M. H.","Bifet, A.","Abdessalem, T."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["Mostafa","Haghir"],"propositions":[],"lastnames":["Chehreghani"],"suffixes":[]},{"firstnames":["Albert"],"propositions":[],"lastnames":["Bifet"],"suffixes":[]},{"firstnames":["Talel"],"propositions":[],"lastnames":["Abdessalem"],"suffixes":[]}],"title":"Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs","booktitle":"Advances in Knowledge Discovery and Data Mining - 22nd Pacific-Asia Conference, PAKDD 2018, Melbourne, VIC, Australia, June 3-6, 2018, Proceedings, Part III","pages":"752–764","year":"2018","crossref":"DBLP:conf/pakdd/2018-3","url":"https://doi.org/10.1007/978-3-319-93040-4_59","doi":"10.1007/978-3-319-93040-4_59","timestamp":"Tue, 14 May 2019 10:00:51 +0200","biburl":"https://dblp.org/rec/bib/conf/pakdd/ChehreghaniBA18","bibsource":"dblp computer science bibliography, https://dblp.org","bibtex":"@inproceedings{DBLP:conf/pakdd/ChehreghaniBA18,\n author = {Mostafa Haghir Chehreghani and\n Albert Bifet and\n Talel Abdessalem},\n title = {Efficient Exact and Approximate Algorithms for Computing Betweenness\n Centrality in Directed Graphs},\n booktitle = {Advances in Knowledge Discovery and Data Mining - 22nd Pacific-Asia\n Conference, {PAKDD} 2018, Melbourne, VIC, Australia, June 3-6, 2018,\n Proceedings, Part {III}},\n pages = {752--764},\n year = {2018},\n crossref = {DBLP:conf/pakdd/2018-3},\n url = {https://doi.org/10.1007/978-3-319-93040-4\\_59},\n doi = {10.1007/978-3-319-93040-4\\_59},\n timestamp = {Tue, 14 May 2019 10:00:51 +0200},\n biburl = {https://dblp.org/rec/bib/conf/pakdd/ChehreghaniBA18},\n bibsource = {dblp computer science bibliography, https://dblp.org}\n}\n\n","author_short":["Chehreghani, M. H.","Bifet, A.","Abdessalem, T."],"key":"DBLP:conf/pakdd/ChehreghaniBA18","id":"DBLP:conf/pakdd/ChehreghaniBA18","bibbaseid":"chehreghani-bifet-abdessalem-efficientexactandapproximatealgorithmsforcomputingbetweennesscentralityindirectedgraphs-2018","role":"author","urls":{"Paper":"https://doi.org/10.1007/978-3-319-93040-4_59"},"downloads":0},"bibtype":"inproceedings","biburl":"https://dblp.uni-trier.de/pers/tb2/b/Bifet:Albert.bib","creationDate":"2019-12-06T04:09:42.106Z","downloads":0,"keywords":[],"search_terms":["efficient","exact","approximate","algorithms","computing","betweenness","centrality","directed","graphs","chehreghani","bifet","abdessalem"],"title":"Efficient Exact and Approximate Algorithms for Computing Betweenness Centrality in Directed Graphs","year":2018,"dataSources":["fSK4Xnb68KncfLSNv"]}