@article{noKey,
  abstract = {Bildeten die Keimzellen des Internet noch kleine und einfach strukturierte Netze, so vergrößerten sich sowohl seine physikalischen als auch seine logischen Topologien später rasant. Wuchs einerseits das Netz aus Rechnern als Knoten und Verbindungsleitungen als Kanten immer weiter, so bedienten sich andererseits gleichzeitig immer mehr Anwendungen dieser Infrastruktur, um darüber ihrerseits immer größere und komplexere virtuelle Netze zu weben, z. B. das WWW oder soziale Online-Netze. Auf jeder Ebene dieser Hierarchie lassen sich die jeweiligen Netztopologien mithilfe von Graphen beschreiben und so mathematisch untersuchen. So ergeben sich interessante Einblicke in die Struktureigenschaften unterschiedlicher Graphentypen, die großen Einfluss auf die Leistungsfähigkeit des Internet haben. Hierzu werden charakteristische Eigenschaften und entsprechende Kenngrößen verschiedener Graphentypen betrachtet wie der Knotengrad, die Durchschnittsdistanz, die Variation der Kantendichte in unterschiedlichen Netzteilen und die topologische Robustheit als Widerstandsfähigkeit gegenüber Ausfällen und Angriffen. Es wird dabei Bezug genommen auf analytische, simulative und zahlreiche empirische Untersuchungen des Internets und hingewiesen auf Simulationsprogramme sowie Abbildungen von Internetgraphen im Internet. },
  author = {Heidtmann, Klaus},
  doi = {10.1007/s00287-012-0654-z},
  interhash = {d1ab5ecb2270150ba3d46e156d3a1139},
  intrahash = {783481b980117c756d4560c1640ae4a0},
  issn = {0170-6012},
  journal = {Informatik-Spektrum},
  language = {German},
  number = 5,
  pages = {440-448},
  publisher = {Springer Berlin Heidelberg},
  title = {Internet-Graphen},
  url = {http://dx.doi.org/10.1007/s00287-012-0654-z},
  volume = 36,
  year = 2013
}

@article{Mucha14052010,
  abstract = {Network science is an interdisciplinary endeavor, with methods and applications drawn from across the natural, social, and information sciences. A prominent problem in network science is the algorithmic detection of tightly connected groups of nodes known as communities. We developed a generalized framework of network quality functions that allowed us to study the community structure of arbitrary multislice networks, which are combinations of individual networks coupled through links that connect each node in one network slice to itself in other slices. This framework allows studies of community structure in a general setting encompassing networks that evolve over time, have multiple types of links (multiplexity), and have multiple scales.},
  author = {Mucha, Peter J. and Richardson, Thomas and Macon, Kevin and Porter, Mason A. and Onnela, Jukka-Pekka},
  doi = {10.1126/science.1184819},
  eprint = {http://www.sciencemag.org/content/328/5980/876.full.pdf},
  interhash = {7cc01f266e3a745d2be16a9a3b377695},
  intrahash = {c5b7cfb584d5aee1a941a8e5d3e856b1},
  journal = {Science},
  number = 5980,
  pages = {876-878},
  title = {Community Structure in Time-Dependent, Multiscale, and Multiplex Networks},
  url = {http://www.sciencemag.org/content/328/5980/876.abstract},
  volume = 328,
  year = 2010
}

@misc{Ghosh2009,
  abstract = {  Heterogeneous networks play a key role in the evolution of communities and
the decisions individuals make. These networks link different types of
entities, for example, people and the events they attend. Network analysis
algorithms usually project such networks unto simple graphs composed of
entities of a single type. In the process, they conflate relations between
entities of different types and loose important structural information. We
develop a mathematical framework that can be used to compactly represent and
analyze heterogeneous networks that combine multiple entity and link types. We
generalize Bonacich centrality, which measures connectivity between nodes by
the number of paths between them, to heterogeneous networks and use this
measure to study network structure. Specifically, we extend the popular
modularity-maximization method for community detection to use this centrality
metric. We also rank nodes based on their connectivity to other nodes. One
advantage of this centrality metric is that it has a tunable parameter we can
use to set the length scale of interactions. By studying how rankings change
with this parameter allows us to identify important nodes in the network. We
apply the proposed method to analyze the structure of several heterogeneous
networks. We show that exploiting additional sources of evidence corresponding
to links between, as well as among, different entity types yields new insights
into network structure.
},
  author = {Ghosh, Rumi and Lerman, Kristina},
  interhash = {761e199eb96643cf601e15cb03c3285a},
  intrahash = {3a4a889123d20e0a4d14d06f670de54b},
  note = {cite arxiv:0906.2212
},
  title = {Structure of Heterogeneous Networks},
  url = {http://arxiv.org/abs/0906.2212},
  year = 2009
}

@proceedings{dau05contributions,
  address = {Kassel},
  booktitle = {Contributions to ICCS 2005},
  editor = {Dau, Frithjof and Mugnier, Marie-Laure and Stumme, Gerd},
  interhash = {1d639a4ee220bfb2e4e345921da8f57b},
  intrahash = {922eeab1c4a936636813e44c6b42092e},
  isbn = {3-89958-138-5},
  publisher = {kassel university press},
  title = {Contributions to ICCS 2005},
  url = {http://www.kde.cs.uni-kassel.de/conf/iccs05},
  year = 2005
}

@proceedings{conf/iccs/2005,
  bibsource = {DBLP, http://dblp.uni-trier.de},
  booktitle = {ICCS},
  editor = {Dau, Frithjof and Mugnier, Marie-Laure and Stumme, Gerd},
  interhash = {a8f702ec263f350956e647b7e0b54ee0},
  intrahash = {049a73d0f39efc7d4d988f262911c6f4},
  isbn = {3-540-27783-8},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Conceptual Structures: Common Semantics for Sharing Knowledge, 13th International Conference on Conceptual Structures, ICCS 2005, Kassel, Germany, July 17-22, 2005, Proceedings},
  url = {http://www.kde.cs.uni-kassel.de/conf/iccs05},
  volume = 3596,
  year = 2005
}

@proceedings{delugach01conceptual,
  address = {Heidelberg},
  comment = {alpha},
  editor = {Delugach, H. and Stumme, G.},
  interhash = {b7c32894fcd1ae3e78f0ecb38bba66c0},
  intrahash = {45c60d52ca51dfb995a284f3a9dd14a0},
  publisher = {Springer},
  series = {LNAI},
  title = {Conceptual Structures -- Broadening the Base. Proc. 9th International Conference on Conceptual Structures},
  volume = 2120,
  year = 2001
}

@inproceedings{eklund00contextual,
  address = {Heidelberg},
  author = {Eklund, P. and Groh, B. and Stumme, G. and Wille, R.},
  booktitle = {Conceptual Structures: Logical, Linguistic, and Computational},
  comment = {alpha},
  editor = {Ganter, B. and Mineau, G. W.},
  interhash = {b15b76a5407efbdbb2a11b18a13febcb},
  intrahash = {eb6e678cba7f48ae8604d59542cd79c6},
  pages = {453-467},
  publisher = {Springer},
  series = {LNAI},
  title = {Contextual-Logic Extension of TOSCANA.},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/ICCS_toscanaextension.pdf},
  volume = 1867,
  year = 2000
}

@article{stumme008thinternational,
  author = {Stumme, G.},
  comment = {alpha},
  interhash = {0ee3ac4596cc1fb7151cc9ef66b44306},
  intrahash = {05cb8e9ff42c2d21a876b5af5df46e1b},
  journal = {Knowledge Organization},
  number = 3,
  pages = 162,
  title = {8th {I}nternational {C}onference on {C}onceptual {S}tructures. {C}onference {R}eport},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/ConferenceReportICCS00.pdf},
  volume = 27,
  year = 2000
}

@proceedings{stumme00working,
  address = {Aachen},
  comment = {alpha},
  editor = {Stumme, G.},
  interhash = {0fe2ae59eaf4ab8ceb231789fe4191ba},
  intrahash = {ade62f61239d92022347243cc1962cc0},
  publisher = {Shaker},
  title = {Working with Conceptual Structures -- Contributions to ICCS 2000. Suppl. Proc. 8th International
                  Conference on Conceptual Structures (ICCS 2000)},
  year = 2000
}

@inproceedings{mineau99conceptual,
  address = {Heidelberg},
  author = {Mineau, Guy and Stumme, Gerd and Wille, Rudolf},
  booktitle = {Conceptual Structures: Standards  and  Practices. Proc. ICCS '99},
  editor = {Tepfenhart, W. and Cyre, W.},
  interhash = {da964e12b882b59f6562a5e5ebb346ae},
  intrahash = {162279b2ef7ec69ab0bf0dc3a7b79b18},
  page = {318-331},
  pages = {423-441},
  publisher = {Springer},
  series = {LNAI},
  title = {Conceptual Structures  Represented by Conceptual Graphs and Formal Concept Analysis},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/1999/ICCS99.pdf},
  volume = 1640,
  year = 1999
}

@inproceedings{zhu2008graph,
  author = {Zhu, Feida and Chen, Chen and Yan, Xifeng and Han, Jiawei and Yu, Philip S},
  booktitle = {Proc. 2008 Int. Conf. on Data Mining (ICDM'08), Pisa, Italy, Dec. 2008.},
  interhash = {b9f7956dd1e140a386376df25f1a4117},
  intrahash = {066f245bd365c69acfff1378d72dc01e},
  month = {December},
  title = {{Graph OLAP: Towards Online Analytical Processing on Graphs}},
  year = 2008
}

@book{sowa84,
  address = {Reading, MA},
  author = {Sowa, J. F.},
  interhash = {dc56d323330a14bf76849f897ff2fe3d},
  intrahash = {aa374e6ccc36451fbbc26c12d7cecf56},
  location = {Aix-en-Provence, France},
  publisher = {Addison-Wesley Publishing Company},
  title = {Conceptual Structures: Information Processing in Mind and Machine},
  year = 1984
}

@inproceedings{wille97conceptual,
  address = {Heidelberg},
  author = {Wille, Rudolf},
  booktitle = {Conceptual Structures: Fulfilling Peirce's Dream},
  citeulike-article-id = {1438792},
  editor = {Lukose, D. and Delugach, H. and Keeler, M. and Searle, L. and Sowa, J. F.},
  interhash = {b642926b1e67db495edc3b62e1ba7571},
  intrahash = {046f80236ce102035e0efb984ab248aa},
  pages = {290--303},
  publisher = {Springer},
  series = {Lecture Notes in Artificial Intelligence},
  title = {Conceptual Graphs and Formal Concept Analysis},
  volume = 1257,
  year = 1997
}

@inproceedings{prediger99lattice,
  author = {Prediger, Susanne and Wille, Rudolf},
  booktitle = {ICCS},
  crossref = {conf/iccs/1999},
  date = {2002-01-03},
  editor = {Tepfenhart, William M. and Cyre, Walling R.},
  interhash = {ff1665f911f4a900e50bfb656e9e474d},
  intrahash = {7f7198720cc12f30e613b3664fafacf5},
  isbn = {3-540-66223-5},
  pages = {401-414},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {The Lattice of Concept Graphs of a Relationally Scaled Context},
  url = {http://dblp.uni-trier.de/db/conf/iccs/iccs99.html#PredigerW99},
  volume = 1640,
  year = 1999
}