Entry Jancura:2012:DSF from lncs2012i.bib
Last update: Sun Mar 31 02:49:53 MDT 2019
Top |
Symbols |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Jancura:2012:DSF,
author = "Pavol Jancura and Dimitrios Mavroeidis and Elena
Marchiori",
title = "{DEEN}: a Simple and Fast Algorithm for Network
Community Detection",
journal = j-LECT-NOTES-COMP-SCI,
volume = "7548",
pages = "150--163",
year = "2012",
CODEN = "LNCSD9",
DOI = "https://doi.org/10.1007/978-3-642-35686-5_13",
ISSN = "0302-9743 (print), 1611-3349 (electronic)",
ISSN-L = "0302-9743",
bibdate = "Wed Dec 19 15:24:42 MST 2012",
bibsource = "http://www.math.utah.edu/pub/tex/bib/lncs2012i.bib",
URL = "http://link.springer.com/chapter/10.1007/978-3-642-35686-5_13/",
acknowledgement = ack-nhfb,
book-DOI = "https://doi.org/10.1007/978-3-642-35686-5",
book-URL = "http://www.springerlink.com/content/978-3-642-35686-5",
fjournal = "Lecture Notes in Computer Science",
}
Related entries
- algorithm,
7503(0)181,
7503(0)195,
7503(0)254,
7507(0)127,
7507(0)164,
7509(0)203,
7513(0)14,
7513(0)77,
7513(0)164,
7515(0)152,
7515(0)168,
7515(0)183,
7517(0)225,
7523(0)58,
7523(0)175,
7524(0)307,
7530(0)17,
7530(0)34,
7530(0)82,
7534(0)106,
7534(0)149,
7534(0)261,
7535(0)2,
7535(0)37,
7535(0)85,
7535(0)109,
7535(0)135,
7547(0)92,
7548(0)201,
7549(0)306
- Detection,
7507(0)127,
7509(0)18,
7509(0)51,
7510(0)58,
7510(0)74,
7510(0)132,
7510(0)141,
7512(0)66,
7513(0)129,
7513(0)138,
7517(0)178,
7520(0)113,
7530(0)50,
7534(0)178
- Fast,
7511(0)33,
7511(0)138,
7513(0)164,
7523(0)175,
7524(0)67,
7524(0)180,
7532(0)126,
7534(0)14,
7534(0)44,
7535(0)159,
7549(0)326,
7549(0)365
- Network,
7509(0)29,
7509(0)41,
7513(0)33,
7513(0)61,
7513(0)69,
7513(0)94,
7513(0)101,
7513(0)179,
7515(0)30,
7520(0)206,
7523(0)7,
7523(0)58,
7523(0)74,
7523(0)90,
7526(0)1,
7530(0)42,
7530(0)82,
7530(0)97,
7530(0)134,
7531(0)146,
7531(0)239,
7534(0)57,
7538(0)191,
7539(0)132,
7548(0)1
- Simple,
7521(0)61,
7526(0)85