Processing Huge Graphs with Stxxl

Saved in:
Bibliographic Details
Published in:Electronic notes in discrete mathematics Vol. 25; pp. 37 - 38
Main Author: Dementiev, Roman
Format: Journal Article
Language:English
Published: Elsevier B.V 01.08.2006
Subjects:
algorithm engineering
external memory
graph algorithms
I/O-efficient algorithms
large data sets
algorithm engineering
I/O-efficient algorithms
large data sets
graph algorithms
external memory
ISSN:1571-0653, 1571-0653
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Author Dementiev, Roman
Author_xml – sequence: 1
  givenname: Roman
  surname: Dementiev
  fullname: Dementiev, Roman
  email: dementiev@ira.uka.de
  organization: Fakultät für Informatik, Universität Karlsruhe, Am Fasanengarten 5, 76131 Karlsruhe, Germany
BookMark eNp9j8FKw0AURQepYFv9AVfxAxLfm8lMEnAjRVuhoKCuh2TmpZ3QJmUmav17m9aFK-HCu5vzuGfCRm3XEmPXCAkCqtsmodZuEw6gkmPgjI1RZhiDkmL0p1-wSQgNgMgxk2N28-I7QyG4dhUtPlYUzX25W4foy_Xr6LXf7zeX7LwuN4Gufu-UvT8-vM0W8fJ5_jS7X8YGlepjo0hYY9JSUmWEKhA5FCVJZVNuLda5zLO0qCyA5ZTWWAlSVpKsjagy5LWYMn76a3wXgqda77zblv5bI-hBUjd6kNSDpD4GDtDdCaLDsk9HXgfjqDVknSfTa9u5__AfHsNcEw
ContentType Journal Article
Copyright 2006
Copyright_xml – notice: 2006
DBID AAYXX
CITATION
DOI 10.1016/j.endm.2006.06.060
DatabaseName CrossRef
DatabaseTitle CrossRef
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1571-0653
EndPage 38
ExternalDocumentID 10_1016_j_endm_2006_06_060
S1571065306000618
GroupedDBID --K
--M
.~1
0R~
1B1
1~.
1~5
4.4
457
4G.
5GY
5VS
7-5
71M
8P~
AACTN
AAEDT
AAEDW
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AASFE
AAXUO
ABAOU
ABJNI
ABMAC
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFO
ACGFS
ACNNM
ACRLP
ACXMD
ADBBV
ADEZE
ADGUI
ADMUD
AEBSH
AEKER
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AIEXJ
AIGVJ
AIKHN
AITUG
AJMQA
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
APLSM
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CS3
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HAMUX
HVGLF
HZ~
IHE
J1W
KOM
M41
MHUIS
MO0
M~E
N9A
O-L
O9-
OAUVE
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
ROL
RPZ
SDF
SDG
SES
SEW
SPC
SPCBC
SSB
SSD
SSV
SSW
SSZ
T5K
~G-
9DU
AATTM
AAXKI
AAYWO
AAYXX
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
AEIPS
AEUPX
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
CITATION
EFKBS
~HD
ID FETCH-LOGICAL-c166t-c6e3dcc4a5ebc36911209ae56d42dd1f858749bd00d2e4f1b3e6d5e5fc3b712f3
ISSN 1571-0653
IngestDate Sat Nov 29 01:45:44 EST 2025
Fri Feb 23 02:29:56 EST 2024
IsPeerReviewed false
IsScholarly true
Keywords algorithm engineering
I/O-efficient algorithms
large data sets
graph algorithms
external memory
Language English
License https://www.elsevier.com/tdm/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c166t-c6e3dcc4a5ebc36911209ae56d42dd1f858749bd00d2e4f1b3e6d5e5fc3b712f3
PageCount 2
ParticipantIDs crossref_primary_10_1016_j_endm_2006_06_060
elsevier_sciencedirect_doi_10_1016_j_endm_2006_06_060
PublicationCentury 2000
PublicationDate 2006-08-01
PublicationDateYYYYMMDD 2006-08-01
PublicationDate_xml – month: 08
  year: 2006
  text: 2006-08-01
  day: 01
PublicationDecade 2000
PublicationTitle Electronic notes in discrete mathematics
PublicationYear 2006
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Dementiev, R., Sanders, P., Schultes, D., Sibeyn, J.: Engineering an External Memory Minimum Spanning Tree Algorithm. In: IFIP TCS, Toulouse (2004) 195–208
Dementiev, Kettner, Sanders (bib001) 2005; volume 3669
Ajwani, Dementiev, Meyer (bib002) 2006
Ajwani (10.1016/j.endm.2006.06.060_bib002) 2006
Dementiev (10.1016/j.endm.2006.06.060_bib001) 2005; volume 3669
10.1016/j.endm.2006.06.060_bib003
References_xml – reference: Dementiev, R., Sanders, P., Schultes, D., Sibeyn, J.: Engineering an External Memory Minimum Spanning Tree Algorithm. In: IFIP TCS, Toulouse (2004) 195–208
– volume: volume 3669
  start-page: 640
  year: 2005
  end-page: 651
  ident: bib001
  article-title: Stxxl: Standard Template Library for XXL Data Sets
  publication-title: 13th Ann. European Symposium on Algorithms (ESA)
– year: 2006
  ident: bib002
  article-title: A Computational Study of External Memory BFS Algorithms
  publication-title: ACM-SIAM Symposium on Discrete Algorithms (SODA-06), Miami, USA
– volume: volume 3669
  start-page: 640
  year: 2005
  ident: 10.1016/j.endm.2006.06.060_bib001
  article-title: Stxxl: Standard Template Library for XXL Data Sets
– year: 2006
  ident: 10.1016/j.endm.2006.06.060_bib002
  article-title: A Computational Study of External Memory BFS Algorithms
– ident: 10.1016/j.endm.2006.06.060_bib003
SSID ssj0038175
Score 1.6400301
SourceID crossref
elsevier
SourceType Index Database
Publisher
StartPage 37
SubjectTerms algorithm engineering
external memory
graph algorithms
I/O-efficient algorithms
large data sets
Title Processing Huge Graphs with Stxxl
URI https://dx.doi.org/10.1016/j.endm.2006.06.060
Volume 25
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: ScienceDirect Freedom Collection - Elsevier
  customDbUrl:
  eissn: 1571-0653
  dateEnd: 20190331
  omitProxy: false
  ssIdentifier: ssj0038175
  issn: 1571-0653
  databaseCode: AIEXJ
  dateStart: 19990301
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 1571-0653
  dateEnd: 20191231
  omitProxy: false
  ssIdentifier: ssj0038175
  issn: 1571-0653
  databaseCode: M~E
  dateStart: 19990101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1JS8NAFB60evDiLtaNCN5KSjrJZDmKVHrQIrRKbyGZRSo2LW0qOfnbfZOZNNEWUUEYhjBhlsw3ee_l5S0IXVHHFnbAqWnhSJiOj6kZARs2qRd4QlgRZ7kvzNOd1-36g0HwoLPwzfJ0Al6S-FkWTP4VamgDsKXr7C_gXgwKDXANoEMNsEP9I-C16b9UAXTmz3AIZEhq7cTWS7Ps9ZMyvsyCk4xTroxjh0BKQJZujBYhXcvs87k2cQhryq2yR_psVdQGflVtsOzPosifJ-2gVPjeJl_RpmkmJhWip6K2aPapYrUsEWalI3hp8oSN9C8gWaySDS2MA3tyRjkh3JYSlr-ONrBHAmmwd__eLvisDC1I8mi4en3aJUpZ732dZ7XYUREl-rtoW38DGNcKuz20xpN9tFPk1zA0uT1AlyWUhoTSUFAaEkojh_IQPd62-zcdU6e0MGnLdVOTutxmlDoR4TG1XeA02AoiTlzmYMZawie-5wQxsyyGuSNasc1dRjgR1I69Fhb2Eaol44QfIwMkSRxFUqsv4IUjPLJZ7MA4sCuCBY6oo0bxxOFERS4JC5O-l1Duj0xB6oZ5seqIFJsSatlLyVQhIPhNv5M_9jtFW-WpPEO1dDrn52iTvqXD2fQiB_oD9IlRcQ
linkProvider ISSN International Centre
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Processing+Huge+Graphs+with+Stxxl&rft.jtitle=Electronic+notes+in+discrete+mathematics&rft.au=Dementiev%2C+Roman&rft.date=2006-08-01&rft.pub=Elsevier+B.V&rft.issn=1571-0653&rft.eissn=1571-0653&rft.volume=25&rft.spage=37&rft.epage=38&rft_id=info:doi/10.1016%2Fj.endm.2006.06.060&rft.externalDocID=S1571065306000618
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1571-0653&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1571-0653&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1571-0653&client=summon