@inproceedings{kondor02diffusionkernel, title = {Diffusion Kernels on Graphs and Other Discrete Input Spaces}, address = {San Francisco, CA, USA}, author = {Risi Imre Kondor and John D. Lafferty}, booktitle = {ICML '02: Proceedings of the Nineteenth International Conference on Machine Learning}, pages = {315--322}, publisher = {Morgan Kaufmann Publishers Inc.}, year = 2002, url = {http://www.cs.cmu.edu/~lafferty/pub/diffusion-kernels.ps}, isbn = {1-55860-873-7}, biburl = {http://www.bibsonomy.org/bibtex/23a49cc3c52a3f5fe1474f822b3f973b0/schmitz}, keywords = {svm graph kernel} } @book{berge1985graphs, title = {Graphs and Hypergraphs}, author = {Claude Berge}, publisher = {Elsevier Science Ltd}, year = 1985, description = {Graphs and Hypergraphs}, biburl = {http://www.bibsonomy.org/bibtex/2db61bde56bc8e7a3ccecc35305b72118/schmitz}, keywords = {graph hypergraph graphtheory} } @article{kleinberg1999hits, title = {Authoritative sources in a hyperlinked environment}, author = {Jon M. Kleinberg}, journal = {Journal of the ACM}, number = 5, pages = {604--632}, volume = 46, year = 1999, url = {http://citeseer.ist.psu.edu/kleinberg99authoritative.html}, id = {1115}, priority = {1}, comment = {HITS algorithm}, abstract = {. The network structure of a hyperlinked environment can be a rich source of information about the content of the environment, provided we have effective means for understanding it. We develop a set of algorithmic tools for extracting information from the link structures of such environments, and report on experiments that demonstrate their effectiveness in a variety of contexts on the World Wide Web. The central issue we address within our framework is the distillation of broad search topics,...}, biburl = {http://www.bibsonomy.org/bibtex/2c86549355475331f563d0a3ba7816dab/schmitz}, keywords = {web hits mining graph ranking} } @article{berge1989hypergraphs, title = {Hypergraphs}, author = {Claude Berge}, edition = {3rd}, pages = 256, publisher = {Elsevier}, year = 1989, biburl = {http://www.bibsonomy.org/bibtex/27daae7bfcc64f52e6faa3e4d5d7e12cd/schmitz}, keywords = {graphtheory graph hypergraph} } @inproceedings{conf/isaac/BrandesL04, title = {Structural Similarity in Graphs (A Relaxation Approach for Role Assignment).}, author = {Ulrik Brandes and Jürgen Lerner}, booktitle = {ISAAC}, crossref = {conf/isaac/2004}, editor = {Rudolf Fleischer and Gerhard Trippen}, pages = {184-195}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = 3341, year = 2004, url = {http://dblp.uni-trier.de/db/conf/isaac/isaac2004.html#BrandesL04}, ee = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3341&spage=184}, isbn = {3-540-24131-0}, date = {2004-12-13}, description = {dblp}, biburl = {http://www.bibsonomy.org/bibtex/2fb96363fda06e80943498e293c6e402a/schmitz}, keywords = {graphtheory similarity distance metric graph} } @article{albert-2000-85, title = {Topology of evolving networks: local events and universality}, author = {Reka Albert and Albert-Laszlo Barabasi}, journal = {Physical Review Letters}, pages = 5234, volume = 85, year = 2000, url = {http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0005085}, biburl = {http://www.bibsonomy.org/bibtex/29a69c6cc7772afe370c3de080fa37049/schmitz}, keywords = {graphtheory network preferentialattachment mining sna graph barabasi} } @book{siek2002bgl, title = {The Boost Graph Library User Guide and Reference Manual (With CD-ROM)}, author = {Jeremy G. Siek and Lie-Quan Lee and Andrew Lumsdaine}, year = 2002, url = {http://www.amazon.com/Boost-Library-Reference-Manual-CD-ROM/dp/0201729148/sr=8-1/qid=1167322065/ref=pd_bbs_sr_1/102-2509724-6229731?ie=UTF8&s=books}, typesource = {Simple CitationSource}, source = {}, asin = {0201729148}, pubmed = {}, doi = {}, description = {Amazon.com: The Boost Graph Library User Guide and Reference Manual (With CD-ROM): Books: Jeremy G. Siek,Lie-Quan Lee,Andrew Lumsdaine}, biburl = {http://www.bibsonomy.org/bibtex/255e8994016dbd04844be73e3216dc36f/schmitz}, keywords = {book programming library c++ graph boost graphtheory} } @book{bollobas2001random, title = {Random Graphs}, author = {B. Bollobas}, editor = {W. Fulton and A. Katok and F. Kirwan and P. Sarnak and B. Simon and B. Totaro}, publisher = {Cambridge University Press}, year = 2001, id = {827976}, priority = {5}, biburl = {http://www.bibsonomy.org/bibtex/2a08b7937f79ce0cf9854806274e42ee1/schmitz}, keywords = {random graph} } @inproceedings{paper3, title = {Introspective Subgroup Analysis for Interactive Knowledge Refinement}, author = {Martin Atzmueller and Joachim Baumeister and Frank Puppe}, booktitle = {Proc. of the 19th International Florida Artificial Intelligence Research Society Conference (FLAIRS-2006), pp. 402-407, AAAI Press, USA}, year = 2006, biburl = {http://www.bibsonomy.org/bibtex/29fb8eef22247ddd394fa9e19512484c1/schmitz}, keywords = {clustering graph mining baumeister} } @article{bornholdt-2000-267, title = {Robustness as an Evolutionary Principle}, author = {Stefan Bornholdt and Kim Sneppen}, journal = {PROC.R.SOC.LOND.B}, pages = 2281, volume = 267, year = 2000, url = {http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0003333}, biburl = {http://www.bibsonomy.org/bibtex/271ff9c3b5829fbc195a4c0e45ce26bb1/schmitz}, keywords = {sna evolution network graph} } @article{PhysRevLett.89.258702, title = {Scale-Free Networks from Varying Vertex Intrinsic Fitness}, author = {G. Caldarelli and A. Capocci and P. De Los Rios and M. A. Mu\ noz}, journal = {Phys. Rev. Lett.}, month = {Dec}, number = 25, pages = 258702, publisher = {American Physical Society}, volume = 89, year = 2002, numpages = {4}, doi = {10.1103/PhysRevLett.89.258702}, biburl = {http://www.bibsonomy.org/bibtex/24e685792bfb95c46141d38e048a2a785/schmitz}, keywords = {scalefree graphgenerator graph network evolution} } @article{menczer2002growing, title = {Growing and navigating the small world web by local content}, author = {F. Menczer}, journal = {Proceedings of the National Academy of Sciences}, number = 22, pages = {14014--14019}, volume = 99, year = 2002, biburl = {http://www.bibsonomy.org/bibtex/218020a2bbb20a933e042fa2d93292a03/schmitz}, keywords = {evolution sna graph smallworld} } @article{barthelemy-2004-92, title = {Velocity and hierarchical spread of epidemic outbreaks in scale-free networks}, author = {Marc Barthelemy and Alain Barrat and Romualdo Pastor-Satorras and Alessandro Vespignani}, journal = {Physical Review Letters}, pages = 178701, volume = 92, year = 2004, url = {http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0311501}, biburl = {http://www.bibsonomy.org/bibtex/2a5b40f4a5123d549488c8570d2fc7b7f/schmitz}, keywords = {weightedclustco graph evolution clustco toread sna} } @article{barrat-2004-92, title = {Weighted evolving networks: coupling topology and weights dynamics}, author = {Alain Barrat and Marc Barthelemy and Alessandro Vespignani}, journal = {Physical Review Letters}, pages = 228701, volume = 92, year = 2004, url = {\url{http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0401057}}, biburl = {http://www.bibsonomy.org/bibtex/26a115d530e6d78336c792fdff70d4bf9/schmitz}, keywords = {graph evolution clustco weightedclustco toread sna} } @article{szabo2004clustering, title = {Clustering in Complex Networks }, author = {Gábor Szabó and Mikko Alava and János Kertész}, number = 650, pages = {139-162}, publisher = {Springer}, series = {Lecture Notes in Physics}, year = 2004, biburl = {http://www.bibsonomy.org/bibtex/279627cbb167963529e9670f2b9f9b0e3/schmitz}, keywords = {network evolution sna preferentialattachment graph} } @article{kleinberg2006complex, title = {Complex Networks and Decentralized Search Algorithms}, author = {Jon Kleinberg}, booktitle = {Proceedings of the International Congress of Mathematicians (ICM)}, year = 2006, biburl = {http://www.bibsonomy.org/bibtex/21cb05b9777c127e71aab3d6a8538552e/schmitz}, keywords = {kleinberg sna routing graph evolution graphgenerator} } @inproceedings{conf/nips/Kleinberg01, title = {Small-World Phenomena and the Dynamics of Information.}, author = {Jon M. Kleinberg}, booktitle = {NIPS}, pages = {431-438}, year = 2001, url = {http://dblp.uni-trier.de/db/conf/nips/nips2001.html#Kleinberg01}, ee = {http://www-2.cs.cmu.edu/Groups/NIPS/NIPS2001/papers/psgz/Kleinberg.ps.gz}, description = {dblp}, biburl = {http://www.bibsonomy.org/bibtex/2acff1ece0b3ffe1924413b8e1cbcecf5/schmitz}, keywords = {evolution smallworld sna graph} } @techreport{jin02smallworld, title = {Small-world internet topologies: Possible causes and implications on scalability of end-system multicast}, author = {S. Jin and A. Bestavros}, institution = {Boston University}, number = {BUCS-2002-004}, year = 2002, url = {citeseer.ist.psu.edu/jin02smallworld.html}, description = {Small-World Internet Topologies: Possible Causes and Implications on Scalability of End-System Multicast - Jin, Bestavros (ResearchIndex)}, biburl = {http://www.bibsonomy.org/bibtex/22924bb99ded1d2c9797a9333a852cdf7/schmitz}, keywords = {graphgenerator graph evolution smallworld} } @inproceedings{faloutsos99powerlaw, title = {On Power-law Relationships of the Internet Topology}, author = {Michalis Faloutsos and Petros Faloutsos and Christos Faloutsos}, booktitle = {{SIGCOMM}}, pages = {251-262}, year = 1999, url = {http://citeseer.nj.nec.com/faloutsos99powerlaw.html}, comment = {p2p evaluation verteilung von peers im internet}, biburl = {http://www.bibsonomy.org/bibtex/25f5c74d43838240469d9528ca54d8907/schmitz}, keywords = {evolution powerlaw model graphtheory graph faloutsos smallworld internet} } @techreport{habegger2002modeling, title = { Modeling the Topology of the Internet---An Assessment}, author = {Pascal Habegger and Hanspeter Bieri}, institution = {Institute of Computer Science and Applied Mathematics, University of Bern, Switzerland}, number = {iam-02-002}, year = 2002, biburl = {http://www.bibsonomy.org/bibtex/22db65142882eeb46c62ba8e5bd4c045b/schmitz}, keywords = {graph graphgenerator evolution} }