{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T16:28:29Z","timestamp":1773246509319,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540788072","type":"print"},{"value":"9783540788089","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78808-9_13","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"137-148","source":"Crossref","is-referenced-by-count":14,"title":["Characterization of Graphs Using Degree Cores"],"prefix":"10.1007","author":[{"given":"John","family":"Healy","sequence":"first","affiliation":[]},{"given":"Jeannette","family":"Janssen","sequence":"additional","affiliation":[]},{"given":"Evangelos","family":"Milios","sequence":"additional","affiliation":[]},{"given":"William","family":"Aiello","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Pr\u017eulj, N., Corneil, D.G., Jurisica, I.: Modeling interactome: scale-free or geometric? Bioinformatics\u00a020(18), 3508\u20133515","DOI":"10.1093\/bioinformatics\/bth436"},{"key":"13_CR2","unstructured":"Batagelj, V.: Zaver\u0161nik, M.: Generalized Cores. ArXiv Computer Science e-prints (2002)"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Seidman, S.B.: Network structure and minimum degree. Social Networks, 269\u2013287 (1983)","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"13_CR4","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511815478","volume-title":"Social network analysis: Methods and applications","author":"S. Wasserman","year":"1994","unstructured":"Wasserman, S., Faust, K.: Social network analysis: Methods and applications. Cambridge University Press, Cambridge (1994)"},{"key":"13_CR5","unstructured":"Alvarez-Hamelin, I., Dall\u2019Asta, L., Barrat, A., Vespignani, A.: DELIS-TR-0166 - k-core decomposition: A tool for the visualization of large scale networks. techreport 0166, DELIS \u2013 Dynamically Evolving Large-scale Information Systems (2004)"},{"key":"13_CR6","unstructured":"Alvarez-Hamelin, I., Barrat, A., Dall\u2019Asta, L., Vespignani, A.: k-core decomposition: A tool for the analysis of large scale internet graphs. Computer Science, cs.NI\/0511007 (2005)"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Batagelj, V., Mrvar, A.: Pajek - Analysis and Visualization of Large Networks, vol.\u00a02265 (January 2002)","DOI":"10.1007\/3-540-45848-4_54"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Wuchty, S., Almaas, E.: Peeling the yeast protein network. Proteomics (2005)","DOI":"10.1002\/pmic.200400962"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1186\/1471-2105-4-2","volume":"4","author":"G.D. Bader","year":"2003","unstructured":"Bader, G.D., Hogue, C.W.: An automated method for finding molecular complexes in large protein interaction networks. BMC Bioinformatics\u00a04, 2 (2003)","journal-title":"BMC Bioinformatics"},{"key":"13_CR10","unstructured":"Gaertler, M., Patrignani, M.: DELIS-TR-0003 - dynamic analysis of the autonomous system graph. In: Proceedings 0003, 2004, IPS 2004 (Inter-Domain Performance and Simulation) (2004)"},{"key":"13_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-21606-5","volume-title":"The Elements of Statistical Learning: Data Mining, Inference, and Prediction","author":"T. Hastie","year":"2001","unstructured":"Hastie, T., Tibshirani, R., Friedman, J.: The Elements of Statistical Learning: Data Mining, Inference, and Prediction. Springer, Heidelberg (2001)"},{"key":"13_CR12","volume-title":"Proceedings of the Workshop on Combinatorial and Algorithmic Aspects of Networking (CANN 2004)","author":"A. Bonato","year":"2004","unstructured":"Bonato, A.: A survey of models of the web graph. In: Proceedings of the Workshop on Combinatorial and Algorithmic Aspects of Networking (CANN 2004), Springer, Heidelberg (2004)"},{"issue":"5","key":"13_CR13","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1089\/106652703322539024","volume":"10","author":"F. Chung","year":"2003","unstructured":"Chung, F., Lu, L., Dewey, T.G., Galas, D.J.: Duplication models for biological networks. Journal of Computational Biology\u00a010(5), 677\u2013687 (2003)","journal-title":"Journal of Computational Biology"},{"key":"13_CR14","unstructured":"TREC: The.gov test collection (last accessed August 28, 2006)"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Hall, B.H., Jaffe, A.B., Trajtenberg, M.: The nber patent citation data file: Lessons, insights and methodological tools. NBER Working Papers 8498, National Bureau of Economic Research, Inc (October 2001) (last accessed August, 30 2006), http:\/\/ideas.repec.org\/p\/nbr\/nberwo\/8498.html","DOI":"10.3386\/w8498"},{"key":"13_CR16","unstructured":"Wan, X., Janssen, J., Kalyaniwalla, N., Milios, E.: Statistical analysis of dynamic graphs. In: Proceedings of AISB 2006: Adaptation in Artificial and Biological Systems, vol.\u00a03, pp. 176\u2013179 (2006)"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1145\/1148170.1148254","volume-title":"29th Annual International ACM SIGIR Conference on Research & Development on Information Retrieval (SIGIR 2006), Association for Computing Machinery (ACM)","author":"R. Angelova","year":"2006","unstructured":"Angelova, R., Weikum, G.: Graph-based text classification: Learn from your neighbors. In: 29th Annual International ACM SIGIR Conference on Research & Development on Information Retrieval (SIGIR 2006), Association for Computing Machinery (ACM), pp. 485\u2013492. ACM, New York (2006)"},{"key":"13_CR18","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On random graphs. Publicationes Mathematicae (1959)"},{"key":"13_CR19","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hungar. Acad. Sci (1961)"},{"key":"13_CR20","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.L., Albert, R.: Emergence of scaling in random networks. Science\u00a0286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"13_CR21","doi-asserted-by":"crossref","unstructured":"Bollob\u00e1s, B., Riordan, O., Spencer, J., Tusn\u00e1dy, G.: The degree sequence of a scale-free random graph process. Random Structures Algorithms (2001)","DOI":"10.1002\/rsa.1009"},{"key":"13_CR22","doi-asserted-by":"crossref","unstructured":"Chung, F., Lu, L.: Coupling online and offline analyses for random power law graphs. In: Internet Mathematics (2003)","DOI":"10.1080\/15427951.2004.10129094"},{"key":"13_CR23","volume-title":"The boost graph library: user guide and reference manual","author":"J.G. Siek","year":"2002","unstructured":"Siek, J.G., Lee, L.Q., Lumsdaine, A.: The boost graph library: User guide and reference manual. Addison-Wesley Longman Publishing Co., Inc., Boston (2002)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web-Graph"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78808-9_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:15:35Z","timestamp":1606184135000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78808-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540788072","9783540788089"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78808-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}