Suchergebnisse - "F.2.2 Nonnumerical Algorithms and Problems. Computations on discrete structures"

Extraction and classification of dense implicit communities in the Web graph

Autoren: Dourisboure Y Geraci F Pellegrini M

Quelle: ACM transactions on the web 3 (2009). doi:10.1145/1513876.1513879
info:cnr-pdr/source/autori:Dourisboure Y.; Geraci F.; Pellegrini M./titolo:Extraction and classification of dense implicit communities in the Web Graph/doi:10.1145%2F1513876.1513879/rivista:ACM transactions on the web/anno:2009/pagina_da:/pagina_a:/intervallo_pagine:/volume:3

Schlagwörter: communities, H.2.8 Database applications. Clustering, web graph, detection of dense subgraph, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, F.2.2 Nonnumerical Algorithms and Problems. Computations on discrete structures

Zugangs-URL: http://wwwold.iit.cnr.it/staff/marco.pellegrini/papiri/jv-cybercom-draft2.pdf
https://dl.acm.org/doi/10.1145/1513876.1513879
https://dblp.uni-trier.de/db/journals/tweb/tweb3.html#DourisboureGP09
https://doi.org/10.1145/1513876.1513879
http://wwwold.iit.cnr.it/staff/marco.pellegrini/papiri/jv-cybercom-draft2.pdf
https://hdl.handle.net/20.500.14243/46197
https://doi.org/10.1145/1513876.1513879

Categories and Subject Descriptors: F.2.2 [Nonnumerical Algorithms and Problems]: Computations on discrete structures; Sequencing and scheduling

Weitere Verfasser: The Pennsylvania State University CiteSeerX Archives

Quelle: http://www.research.att.com/~dsj/papers/sumsqj.ps.

Schlagwörter: General Terms, Algorithms, Experimentation, Theory Additional Key Words and Phrases, Approximation algorithms, average case analysis, bin packing

Dateibeschreibung: application/postscript

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.1258; http://www.research.att.com/~dsj/papers/sumsqj.ps

Verfügbarkeit: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.1258
http://www.research.att.com/~dsj/papers/sumsqj.ps

Discrete Temporal Constraint Satisfaction Problems.

Autoren: Bodirsky, Manuel Martin, Barnaby Mottet, Antoine

Quelle: Journal of the ACM; Jan2018, Vol. 65 Issue 2, p1-41, 41p

Schlagwörter: ENDOMORPHISMS, GENETIC polymorphisms, INTEGERS, COMPUTATIONAL complexity, ELECTRONIC data processing

The Hardness of Data Packing.

Autoren: Lavaee, Rahman

Quelle: ACM / SIGPLAN Notices; Jan2016, Vol. 51 Issue 1, p232-242, 11p