bib.tex

@book{legendre1998numerical,
  title={Numerical Ecology},
  author={Legendre, P. and Legendre, L.F.J.},
  isbn={9780080537870},
  series={Developments in Environmental Modelling},
  year={1998},
  publisher={Elsevier Science}
}

@Book{GareyJohnson:1979,
  author =	"Michael R. Garey and David S. Johnson",
  year = 	"1979",
  keywords =	"THEORY COMPLEXITY BOOK OVERVIEW",
  title =	"Computers and intractability : a guide to the theory
		 of {NP}-completeness /",
  publisher =	"San Francisco : W. H. Freeman, 1979, 338 p. CALL
		 NUMBER: QA76.6 .G35",
}


@Book{Knuth3,
  author =	"Donald E. Knuth",
  title =	"The Art of Computer Programming, Vol 3, Sorting and
		 Searching",
  edition =	"2",
  publisher =	"Addison-Wesley",
  address =	"Reading, USA",
  year = 	"1998",
  ISBN = 	"0-201-89685-0",
}

@article{AlonGutner2010,
 author = {Alon, Noga and Gutner, Shai},
 title = {Balanced Families of Perfect Hash Functions and Their Applications},
 journal = {ACM Trans. Algorithms},
 issue_date = {June 2010},
 volume = {6},
 number = {3},
 month = jul,
 year = {2010},
 issn = {1549-6325},
 pages = {54:1--54:12},
 articleno = {54},
 numpages = {12},
 doi = {10.1145/1798596.1798607},
 publisher = {ACM},
 address = {New York, NY, USA},
} 

@Article{FlumGrohe2004,
  author =	"J{\"o}rg Flum and Martin Grohe",
  title =	"The Parameterized Complexity of Counting Problems",
  journal =	"SIAM Journal on Computing",
  volume =	"33",
  number =	"4",
  pages =	"892--922",
  month =	aug,
  year = 	"2004",
  DOI =  	"http://dx.doi.org/10.1137/S0097539703427203",
}

@article{raymond2002rascal,
  title={Rascal: Calculation of graph similarity using maximum common edge subgraphs},
  author={Raymond, John W and Gardiner, Eleanor J and Willett, Peter},
  journal={The Computer Journal},
  volume={45},
  number={6},
  pages={631--644},
  year={2002},
  publisher={Oxford University Press}
}

@article{bunke1998graph,
  title={A graph distance metric based on the maximal common subgraph},
  author={Bunke, Horst and Shearer, Kim},
  journal={Pattern recognition letters},
  volume={19},
  number={3},
  pages={255--259},
  year={1998},
  publisher={Elsevier}
}

@article{emmert2016fifty,
  title={Fifty years of graph matching, network alignment and network comparison},
  author={Emmert-Streib, Frank and Dehmer, Matthias and Shi, Yongtang},
  journal={Information Sciences},
  volume={346},
  pages={180--197},
  year={2016},
  publisher={Elsevier}
}

@misc{imdb,
    author = "IMDb",
    title = "IMDb Datasets",
    howpublished = {\url{http://www.imdb.com/interfaces/}},
    year = "Accessed October 2017" 
}


@misc{netinf,
    author = "SNAP",
    title = "NetInf",
    howpublished = {\url{http://snap.stanford.edu/netinf/}},
    year = "Accessed October 2017" 
}


@misc{alexarank,
    author = "Alexa",
    title = "Website Traffic, Statistics and Analytics",
    howpublished = {\url{https://www.alexa.com/siteinfo/}},
    year = "Accessed October 2017" 
}

@InCollection{crescenzi2011comparison,
  Title                    = {A comparison of three algorithms for approximating the distance distribution in real-world graphs},
  Author                   = {Crescenzi, Pierluigi and Grossi, Roberto and Lanzi, Leonardo and Marino, Andrea},
  Booktitle                = {TAPAS},
  Publisher                = {Springer},
  Year                     = {2011},
  Pages                    = {92--103}
}

@inproceedings{eppstein2001fast,
  title={Fast approximation of centrality},
  author={Eppstein, David and Wang, Joseph},
  booktitle={Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms},
  pages={228--229},
  year={2001},
  organization={Society for Industrial and Applied Mathematics}
}

@article{fouss2007random,
  title={Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation},
  author={Fouss, Francois and Pirotte, Alain and Renders, Jean-Michel and Saerens, Marco},
  journal={IEEE Transactions on knowledge and data engineering},
  volume={19},
  number={3},
  pages={355--369},
  year={2007},
  publisher={IEEE}
}

@article{tai1979tree,
  title={The tree-to-tree correction problem},
  author={Tai, Kuo-Chung},
  journal={Journal of the ACM (JACM)},
  volume={26},
  number={3},
  pages={422--433},
  year={1979},
  publisher={ACM}
}

@inproceedings{robles2003edit,
  title={Edit Distance From Graph Spectra.},
  author={Robles-Kelly, Antonio and Hancock, Edwin R},
  booktitle={ICCV},
  pages={234--241},
  year={2003}
}

@inproceedings{sokolsky2006simulation,
  title={Simulation-based graph similarity},
  author={Sokolsky, Oleg and Kannan, Sampath and Lee, Insup},
  booktitle={TACAS},
  volume={6},
  pages={426--440},
  year={2006},
  organization={Springer}
}

@article{kleinberg1999authoritative,
  title={Authoritative sources in a hyperlinked environment},
  author={Kleinberg, Jon M},
  journal={Journal of the ACM (JACM)},
  volume={46},
  number={5},
  pages={604--632},
  year={1999},
  publisher={ACM}
}

@book{dehmer2007graph,
  title={Graph-theoretical characterizations of generalized trees},
  author={Dehmer, Matthias and Mehler, Alexander and Emmert-Streib, Frank},
  year={2007},
  publisher={na}
}

@article{zager2008graph,
  title={Graph similarity scoring and matching},
  author={Zager, Laura A and Verghese, George C},
  journal={Applied mathematics letters},
  volume={21},
  number={1},
  pages={86--94},
  year={2008},
  publisher={Elsevier}
}

@book{chartrand2008chromatic,
  title={Chromatic graph theory},
  author={Chartrand, Gary and Zhang, Ping},
  year={2008},
  publisher={CRC press}
}

@article{emmert2012exploring,
  title={Exploring statistical and population aspects of network complexity},
  author={Emmert-Streib, Frank and Dehmer, Matthias},
  journal={PLoS One},
  volume={7},
  number={5},
  pages={e34523},
  year={2012},
  publisher={Public Library of Science}
}

@inproceedings{kashima2003marginalized,
  title={Marginalized kernels between labeled graphs},
  author={Kashima, Hisashi and Tsuda, Koji and Inokuchi, Akihiro},
  booktitle={Proceedings of the 20th international conference on machine learning (ICML-03)},
  pages={321--328},
  year={2003}
}

@article{blondel2004measure,
  title={A measure of similarity between graph vertices\string: applications
        to synonym extraction and {W}eb searching},
  author={Vincent D. Blondel and Anah\'i Gajardo and Maureen Heymans and Pierre Senellart and Paul Van Dooren},
  journal={SIAM Review},
  volume={46},
  number={4},
  pages={647--666},
  year={2004},
  note={Also CoRR cs.IR/0407061},
}

@article{gartner2003graph,
  title={On graph kernels: Hardness results and efficient alternatives},
  author={G{\"a}rtner, Thomas and Flach, Peter and Wrobel, Stefan},
  journal={Learning Theory and Kernel Machines},
  pages={129--143},
  year={2003},
  publisher={Springer}
}

@inproceedings{vishwanathan2006fast,
  title={Fast computation of graph kernels},
  author={Vishwanathan, SVN and Borgwardt, Karsten M and Schraudolph, Nicol N},
  booktitle={Proceedings of the 19th International Conference on Neural Information Processing Systems},
  pages={1449--1456},
  year={2006},
  organization={MIT Press}
}

@inproceedings{borgwardt2005shortest,
  title={Shortest-path kernels on graphs},
  author={Borgwardt, Karsten M and Kriegel, Hans-Peter},
  booktitle={Data Mining, Fifth IEEE International Conference on},
  pages={8--pp},
  year={2005},
  organization={IEEE}
}

@inproceedings{ramon2003expressivity,
  title={Expressivity versus efficiency of graph kernels},
  author={Ramon, Jan and G{\"a}rtner, Thomas},
  booktitle={Proceedings of the first international workshop on mining graphs, trees and sequences},
  pages={65--74},
  year={2003}
}

@inproceedings{horvath2004cyclic,
  title={Cyclic pattern kernels for predictive graph mining},
  author={Horv{\'a}th, Tam{\'a}s and G{\"a}rtner, Thomas and Wrobel, Stefan},
  booktitle={Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining},
  pages={158--167},
  year={2004},
  organization={ACM}
}

@inproceedings{ahmed2015efficient,
  title={Efficient graphlet counting for large networks},
  author={Ahmed, Nesreen K and Neville, Jennifer and Rossi, Ryan A and Duffield, Nick},
  booktitle={Data Mining (ICDM), 2015 IEEE International Conference on},
  pages={1--10},
  year={2015},
  organization={IEEE}
}

@article{prvzulj2004modeling,
  title={Modeling interactome: scale-free or geometric?},
  author={Pr{\v{z}}ulj, Natasa and Corneil, Derek G and Jurisica, Igor},
  journal={Bioinformatics},
  volume={20},
  number={18},
  pages={3508--3515},
  year={2004},
  publisher={Oxford University Press}
}

@inproceedings{yanardag2015deep,
  title={Deep graph kernels},
  author={Yanardag, Pinar and Vishwanathan, SVN},
  booktitle={Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining},
  pages={1365--1374},
  year={2015},
  organization={ACM}
}

@inproceedings{tabei2011kernel,
  title={Kernel-based similarity search in massive graph databases with wavelet trees},
  author={Tabei, Yasuo and Tsuda, Koji},
  booktitle={Proceedings of the 2011 SIAM International Conference on Data Mining},
  pages={154--163},
  year={2011},
  organization={SIAM}
}

@article{gallagher1999compah,
  title={COMPAH documentation},
  author={Gallagher, E},
  journal={User’s Guide and application published at: http://www. es. umb. edu/edgwebp. htm},
  year={1999}
}

@inproceedings{ioffe2010improved,
  title={Improved consistent sampling, weighted minhash and l1 sketching},
  author={Ioffe, Sergey},
  booktitle={Data Mining (ICDM), 2010 IEEE 10th International Conference on},
  pages={246--255},
  year={2010},
  organization={IEEE}
}

@inproceedings{wu2017consistent,
  title={Consistent Weighted Sampling Made More Practical},
  author={Wu, Wei and Li, Bin and Chen, Ling and Zhang, Chengqi},
  booktitle={Proceedings of the 26th International Conference on World Wide Web},
  pages={1035--1043},
  year={2017},
  organization={International World Wide Web Conferences Steering Committee}
}

@article{giscard2017all,
  title={The All-Paths and Cycles Graph Kernel},
  author={Giscard, P-L and Wilson, RC},
  journal={arXiv preprint arXiv:1708.01410},
  year={2017}
}

@article{duffield2007priority,
  title={Priority sampling for estimation of arbitrary subset sums},
  author={Duffield, Nick and Lund, Carsten and Thorup, Mikkel},
  journal={Journal of the ACM (JACM)},
  volume={54},
  number={6},
  pages={32},
  year={2007},
  publisher={ACM}
}

@inproceedings{thorup2013bottom,
  title={Bottom-k and priority sampling, set similarity and subset sums with minimal independence},
  author={Thorup, Mikkel},
  booktitle={Proceedings of the forty-fifth annual ACM symposium on Theory of computing},
  pages={371--380},
  year={2013},
  organization={ACM}
}

@inproceedings{Broder00,
  author    = {Andrei Z. Broder},
  title     = {Identifying and Filtering Near-Duplicate Documents},
  booktitle = {Combinatorial Pattern Matching, 11th Annual Symposium, {CPM} 2000,
               Montreal, Canada, June 21-23, 2000, Proceedings},
  pages     = {1--10},
  year      = {2000},
  doi       = {10.1007/3-540-45123-4_1},
}

@inproceedings{broder1998min,
  title={Min-wise independent permutations},
  author={Broder, Andrei Z and Charikar, Moses and Frieze, Alan M and Mitzenmacher, Michael},
  booktitle={Proceedings of the thirtieth annual ACM symposium on Theory of computing},
  pages={327--336},
  year={1998},
  organization={ACM}
}

@inproceedings{cohen2007summarizing,
  title={Summarizing data using bottom-k sketches},
  author={Cohen, Edith and Kaplan, Haim},
  booktitle={Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing},
  pages={225--234},
  year={2007},
  organization={ACM}
}

@article{alon1995color,
  title={Color-coding},
  author={Alon, Noga and Yuster, Raphael and Zwick, Uri},
  journal={Journal of the ACM (JACM)},
  volume={42},
  number={4},
  pages={844--856},
  year={1995},
  publisher={ACM}
}

@article{alon1997finding,
  title={Finding and counting given length cycles},
  author={Alon, Noga and Yuster, Raphael and Zwick, Uri},
  journal={Algorithmica},
  volume={17},
  number={3},
  pages={209--223},
  year={1997},
  publisher={Springer}
}

@article{flum2004parameterized,
  title={The parameterized complexity of counting problems},
  author={Flum, J{\"o}rg and Grohe, Martin},
  journal={SIAM Journal on Computing},
  volume={33},
  number={4},
  pages={892--922},
  year={2004},
  publisher={SIAM}
}

@inproceedings{hido2009linear,
  title={A linear-time graph kernel},
  author={Hido, Shohei and Kashima, Hisashi},
  booktitle={Data Mining, 2009. ICDM'09. Ninth IEEE International Conference on},
  pages={179--188},
  year={2009},
  organization={IEEE}
}

@article{Siren:2014,
 author = {Sir{\'e}n, Jouni and V\"{a}lim\"{a}ki, Niko and M\"{a}kinen, Veli},
 title = {Indexing Graphs for Path Queries with Applications in Genome Research},
 journal = {IEEE/ACM Trans. Comput. Biol. Bioinformatics},
 issue_date = {March/April 2014},
 volume = {11},
 number = {2},
 month = mar,
 year = {2014},
 pages = {375--388},
 numpages = {14},
 doi = {10.1109/TCBB.2013.2297101},
 publisher = {IEEE Computer Society Press},
}