@inbook {IOPORT.05994667,
    author       = {Kepner, Jeremy and Bader, David A. and Bond, Robert and Bliss, Nadya and Faloutsos, Christos and Hendrickson, Bruce and Gilbert, John and Robinson, Eric},
    title        = {Fundamental questions in the analysis of large graphs.},
    year         = {2011},
    booktitle    = {Graph algorithms in the language of linear algebra},
    isbn         = {978-0-898719-90-1},
    pages        = {353-357},
    publisher    = {Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM)},
    abstract     = {Summary: Graphs are a general approach for representing information that spans the widest possible range of computing applications. They are particularly important to computational biology, web search, and knowledge discovery. As the sizes of graphs increase, the need to apply advanced mathematical and computational techniques to solve these problems is growing dramatically. Examining the mathematical and computational foundations of the analysis of large graphs generally leads to more questions than answers. Of the many questions relating to the the mathematical and computational foundations of the analysis of large graphs, five important classes appear to emerge. These are: Ontology, Schema, Data model, Time evolution, Detection theory, Algorithm scaling, Computer architecture. -- These questions are discussed in greater detail.},
    identifier   = {05994667},
}