Computing maximal cliques in link streams

•We introduce delta-cliques, that generalize graph cliques to link streams/time-varying graphs.•We provide a greedy algorithm to compute all delta-cliques of a link stream.•Implementation available on http://www.github.com/TiphaineV/delta-cliques. A link stream is a collection of triplets (t,u,v) in...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 609; číslo Part 1; s. 245 - 252
Hlavní autoři: Viard, Tiphaine, Latapy, Matthieu, Magnien, Clémence
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 04.01.2016
Elsevier
Témata:
Algorithms
Cliques
Collection
Computation
Computer Science
Contact
Data Structures and Algorithms
Graphs
Intervals
Link streams
Links
Other
Streams
Temporal networks
Time-varying graphs
Link streams
Graphs
Algorithms
Cliques
Time-varying graphs
Temporal networks
algorithms
graphs
time-varying graphs
cliques
temporal networks
link streams
ISSN:0304-3975, 1879-2294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract •We introduce delta-cliques, that generalize graph cliques to link streams/time-varying graphs.•We provide a greedy algorithm to compute all delta-cliques of a link stream.•Implementation available on http://www.github.com/TiphaineV/delta-cliques. A link stream is a collection of triplets (t,u,v) indicating that an interaction occurred between u and v at time t. We generalize the classical notion of cliques in graphs to such link streams: for a given Δ, a Δ-clique is a set of nodes and a time interval such that all pairs of nodes in this set interact at least once during each sub-interval of duration Δ. We propose an algorithm to enumerate all maximal (in terms of nodes or time interval) cliques of a link stream, and illustrate its practical relevance to a real-world contact trace.
AbstractList A link stream is a sequence of triplets $(t,u,v)$ indicating that an interaction occurred between $u$ and $v$ at time $t$. We generalize the classical notion of cliques in graphs to such link streams: for a given $\Delta$, a $\Delta$-clique is a set of nodes and a time interval such that all pairs of nodes in this set interact at least every $\Delta$ during this time interval. We propose an algorithm to enumerate all maximal cliques of a link stream, and illustrate its practical relevance on a real-world contact trace.
•We introduce delta-cliques, that generalize graph cliques to link streams/time-varying graphs.•We provide a greedy algorithm to compute all delta-cliques of a link stream.•Implementation available on http://www.github.com/TiphaineV/delta-cliques. A link stream is a collection of triplets (t,u,v) indicating that an interaction occurred between u and v at time t. We generalize the classical notion of cliques in graphs to such link streams: for a given Δ, a Δ-clique is a set of nodes and a time interval such that all pairs of nodes in this set interact at least once during each sub-interval of duration Δ. We propose an algorithm to enumerate all maximal (in terms of nodes or time interval) cliques of a link stream, and illustrate its practical relevance to a real-world contact trace.
A link stream is a collection of triplets indicating that an interaction occurred between u and v at time t. We generalize the classical notion of cliques in graphs to such link streams: for a given Delta , a Delta -clique is a set of nodes and a time interval such that all pairs of nodes in this set interact at least once during each sub-interval of duration Delta . We propose an algorithm to enumerate all maximal (in terms of nodes or time interval) cliques of a link stream, and illustrate its practical relevance to a real-world contact trace.
Author Latapy, Matthieu
Viard, Tiphaine
Magnien, Clémence
Author_xml – sequence: 1
  givenname: Tiphaine
  surname: Viard
  fullname: Viard, Tiphaine
  email: tiphaine.viard@gmail.com
– sequence: 2
  givenname: Matthieu
  surname: Latapy
  fullname: Latapy, Matthieu
– sequence: 3
  givenname: Clémence
  surname: Magnien
  fullname: Magnien, Clémence
BackLink https://hal.science/hal-01112627$$DView record in HAL
BookMark eNp9kD1PwzAQhi1UJNrCD2DLSIeEcz7sWExVBRSpEgvMluNewCVxiu1W8O9JFMTA0FtOOr3Pq9MzIxPbWSTkmkJCgbLbXRK0T1KgRQIigQzOyJSWXMRpKvIJmfaXPM4ELy7IzPsd9FNwNiWLVdfuD8HYt6hVX6ZVTaQb83lAHxkbNcZ-RD44VK2_JOe1ajxe_e45eX24f1mt483z49NquYl1DjzEfFtWqSoZA1prWqCgVVbrKkXFIUcoWKkLLVRWFVyLmulKcERVCqhUpYEV2Zwsxt531ci9619y37JTRq6XGzncgFKaspQfh-zNmN27bvg5yNZ4jU2jLHYHLynnJeQZZbyP0jGqXee9w_qvm4IcFMqd7BXKQaEEIXthPcP_MdoEFUxng1OmOUnejST2po4GnfTaoNW4NQ51kNvOnKB_ACo_jEE
CitedBy_id crossref_primary_10_1007_s13278_018_0537_7
crossref_primary_10_1145_3418226
crossref_primary_10_1016_j_jcss_2024_103564
crossref_primary_10_1016_j_tcs_2019_03_026
crossref_primary_10_1109_TSMC_2021_3071721
crossref_primary_10_1016_j_osnem_2017_10_003
crossref_primary_10_1109_ACCESS_2019_2953470
crossref_primary_10_1007_s00778_021_00715_z
crossref_primary_10_1007_s11590_023_01975_0
crossref_primary_10_1002_wics_1566
crossref_primary_10_1016_j_ejor_2021_03_051
crossref_primary_10_1155_2022_6976875
crossref_primary_10_1093_comnet_cnac027
crossref_primary_10_1017_nws_2020_38
crossref_primary_10_1109_JPROC_2020_2977595
crossref_primary_10_1007_s00224_018_9876_z
crossref_primary_10_1016_j_ipl_2018_01_006
crossref_primary_10_1016_j_jcss_2020_05_005
crossref_primary_10_1016_j_pmcj_2020_101231
crossref_primary_10_1109_TNSE_2021_3067665
crossref_primary_10_1007_s41109_018_0082_3
crossref_primary_10_1016_j_tcs_2023_113885
crossref_primary_10_1109_TMM_2016_2614224
crossref_primary_10_1016_j_jcss_2024_103551
crossref_primary_10_1016_j_tcs_2018_12_009
crossref_primary_10_1109_ACCESS_2018_2884002
crossref_primary_10_1007_s13278_017_0455_0
crossref_primary_10_1016_j_parco_2019_05_005
crossref_primary_10_1007_s10618_025_01093_8
crossref_primary_10_1016_j_ins_2019_11_003
crossref_primary_10_1007_s13278_024_01292_z
crossref_primary_10_1145_3172867
crossref_primary_10_1016_j_jcss_2021_01_007
crossref_primary_10_1016_j_jcss_2021_03_005
crossref_primary_10_1016_j_jcss_2019_07_006
crossref_primary_10_1088_1367_2630_abe504
crossref_primary_10_1155_2019_6139379
crossref_primary_10_1007_s41109_019_0123_6
crossref_primary_10_1007_s41109_020_00270_6
crossref_primary_10_1016_j_jcss_2019_08_002
crossref_primary_10_1016_j_jcss_2021_04_001
crossref_primary_10_1007_s10115_025_02545_9
crossref_primary_10_1016_j_jcss_2021_04_004
crossref_primary_10_1016_j_jcss_2025_103630
crossref_primary_10_1002_net_22246
crossref_primary_10_1145_3325859
crossref_primary_10_1007_s41109_016_0003_2
crossref_primary_10_1016_j_dam_2025_06_024
crossref_primary_10_1007_s13278_016_0396_z
crossref_primary_10_1007_s00224_024_10174_y
crossref_primary_10_1007_s11280_020_00821_y
crossref_primary_10_1007_s41060_017_0086_6
crossref_primary_10_3390_app12157608
Cites_doi 10.1006/jmbi.1998.1689
10.1145/362342.362367
10.1016/j.tcs.2008.05.010
10.1145/2543629
10.1016/j.tcs.2006.06.015
10.1016/j.physrep.2012.03.001
10.1016/0020-0190(88)90065-8
10.1371/journal.pone.0107878
10.1016/S0304-3975(00)00286-3
ContentType Journal Article
Copyright 2015 Elsevier B.V.
Distributed under a Creative Commons Attribution 4.0 International License
Copyright_xml – notice: 2015 Elsevier B.V.
– notice: Distributed under a Creative Commons Attribution 4.0 International License
DBID AAYXX
CITATION
7SC
8FD
JQ2
L7M
L~C
L~D
1XC
VOOES
DOI 10.1016/j.tcs.2015.09.030
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Hyper Article en Ligne (HAL)
Hyper Article en Ligne (HAL) (Open Access)
DatabaseTitle CrossRef
Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList

Computer and Information Systems Abstracts
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1879-2294
EndPage 252
ExternalDocumentID oai:HAL:hal-01112627v5
10_1016_j_tcs_2015_09_030
S0304397515008701
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1RT
1~.
1~5
4.4
457
4G.
5VS
6I.
7-5
71M
8P~
9JN
AABNK
AACTN
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAXUO
AAYFN
ABAOU
ABBOA
ABJNI
ABMAC
ABVKL
ABYKQ
ACAZW
ACDAQ
ACGFS
ACRLP
ACZNC
ADBBV
ADEZE
AEBSH
AEKER
AENEX
AEXQZ
AFKWA
AFTJW
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ARUGR
AXJTR
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HVGLF
IHE
IXB
J1W
KOM
LG9
M26
M41
MHUIS
MO0
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
RIG
ROL
RPZ
SCC
SDF
SDG
SES
SPC
SPCBC
SSV
SSW
SSZ
T5K
TN5
WH7
YNT
ZMT
~G-
29Q
9DU
AAEDT
AAQXK
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABEFU
ABFNM
ABWVN
ABXDB
ACLOT
ACNNM
ACRPL
ACVFH
ADCNI
ADMUD
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AGHFR
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
ASPBG
AVWKF
AZFZN
CITATION
EFKBS
FGOYB
G-2
HZ~
R2-
SEW
TAE
WUQ
ZY4
~HD
7SC
8FD
JQ2
L7M
L~C
L~D
1XC
VOOES
ID FETCH-LOGICAL-c407t-7d8b2a86601fc15e91b3fcb2ea704e0568c5c9a3b57c9f6cb97eea890babc0653
ISICitedReferencesCount 86
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000367488400018&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0304-3975
IngestDate Tue Oct 14 20:20:00 EDT 2025
Sun Sep 28 11:12:51 EDT 2025
Sat Nov 29 05:15:21 EST 2025
Tue Nov 18 21:59:53 EST 2025
Fri Feb 23 02:30:23 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue Part 1
Keywords Link streams
Graphs
Algorithms
Cliques
Time-varying graphs
Temporal networks
algorithms
graphs
time-varying graphs
cliques
temporal networks
link streams
Language English
License Distributed under a Creative Commons Attribution 4.0 International License: http://creativecommons.org/licenses/by/4.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c407t-7d8b2a86601fc15e91b3fcb2ea704e0568c5c9a3b57c9f6cb97eea890babc0653
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ORCID 0000-0002-5969-5439
0000-0002-0975-6109
OpenAccessLink https://hal.science/hal-01112627
PQID 1778043167
PQPubID 23500
PageCount 8
ParticipantIDs hal_primary_oai_HAL_hal_01112627v5
proquest_miscellaneous_1778043167
crossref_primary_10_1016_j_tcs_2015_09_030
crossref_citationtrail_10_1016_j_tcs_2015_09_030
elsevier_sciencedirect_doi_10_1016_j_tcs_2015_09_030
PublicationCentury 2000
PublicationDate 2016-01-04
PublicationDateYYYYMMDD 2016-01-04
PublicationDate_xml – month: 01
  year: 2016
  text: 2016-01-04
  day: 04
PublicationDecade 2010
PublicationTitle Theoretical computer science
PublicationYear 2016
Publisher Elsevier B.V
Elsevier
Publisher_xml – name: Elsevier B.V
– name: Elsevier
References Bron, Kerbosch (br0010) 1973; 16
Eppstein, Löffler, Strash (br0040) 2013; 18
Samudrala, Moult (br0100) 1998; 279
Johnson, Yannakakis, Papadimitriou (br0070) 1988; 27
Tomita, Tanaka, Takahashi (br0110) 2006; 363
Holme, Saramäki (br0060) 2012; 519
Rowe, Creamer, Hershkop, Stolfo (br0090) 2007
Cazals, Karande (br0030) 2008; 407
Koch (br0080) 2001; 250
Fournet, Barrat (br0050) 2014; 9
Casteigts, Flocchini, Quattrociocchi, Santoro (br0020) 2011; vol. 6811
Wehmuth, Ziviani, Fleury (br0140) 2014
Viard, Latapy (br0120) 2014
Viard, Latapy (br0130) 2014
Viard (10.1016/j.tcs.2015.09.030_br0120) 2014
Koch (10.1016/j.tcs.2015.09.030_br0080) 2001; 250
Wehmuth (10.1016/j.tcs.2015.09.030_br0140) 2014
Viard (10.1016/j.tcs.2015.09.030_br0130)
Samudrala (10.1016/j.tcs.2015.09.030_br0100) 1998; 279
Fournet (10.1016/j.tcs.2015.09.030_br0050) 2014; 9
Casteigts (10.1016/j.tcs.2015.09.030_br0020) 2011; vol. 6811
Bron (10.1016/j.tcs.2015.09.030_br0010) 1973; 16
Cazals (10.1016/j.tcs.2015.09.030_br0030) 2008; 407
Rowe (10.1016/j.tcs.2015.09.030_br0090) 2007
Eppstein (10.1016/j.tcs.2015.09.030_br0040) 2013; 18
Holme (10.1016/j.tcs.2015.09.030_br0060) 2012; 519
Tomita (10.1016/j.tcs.2015.09.030_br0110) 2006; 363
Johnson (10.1016/j.tcs.2015.09.030_br0070) 1988; 27
References_xml – year: 2014
  ident: br0130
  article-title: Source code in python for computing cliques in link streams
– volume: 407
  start-page: 564
  year: 2008
  end-page: 568
  ident: br0030
  article-title: A note on the problem of reporting maximal cliques
  publication-title: Theoret. Comput. Sci.
– volume: 16
  year: 1973
  ident: br0010
  article-title: Algorithm 457: finding all cliques of an undirected graph
  publication-title: Commun. ACM
– volume: 250
  start-page: 1
  year: 2001
  end-page: 30
  ident: br0080
  article-title: Enumerating all connected maximal common subgraphs in two graphs
  publication-title: Theoret. Comput. Sci.
– volume: 519
  start-page: 97
  year: 2012
  end-page: 125
  ident: br0060
  article-title: Temporal networks
  publication-title: Phys. Rep.
– year: 2014
  ident: br0140
  article-title: A unifying model for representing time-varying graphs
– volume: 279
  start-page: 287
  year: 1998
  end-page: 302
  ident: br0100
  article-title: A graph-theoretic algorithm for comparative modeling of protein structure
  publication-title: J. Mol. Biol.
– start-page: 801
  year: 2014
  end-page: 806
  ident: br0120
  article-title: Identifying roles in an IP network with temporal and structural density
  publication-title: Computer Communications Workshops
– volume: 363
  start-page: 28
  year: 2006
  end-page: 42
  ident: br0110
  article-title: The worst-case time complexity for generating all maximal cliques and computational experiments
  publication-title: Theoret. Comput. Sci.
– start-page: 109
  year: 2007
  end-page: 117
  ident: br0090
  article-title: Automated social hierarchy detection through email network analysis
  publication-title: Proceedings of the 9th WebKDD and 1st SNA-KDD 2007 Workshop on Web Mining and Social Network Analysis
– volume: 18
  start-page: 3.1:3.1
  year: 2013
  end-page: 3.1:3.21
  ident: br0040
  article-title: Listing all maximal cliques in large sparse real-world graphs
  publication-title: ACM J. Exp. Algorithmics
– volume: 27
  start-page: 119
  year: 1988
  end-page: 123
  ident: br0070
  article-title: On generating all maximal independent sets
  publication-title: Inform. Process. Lett.
– volume: vol. 6811
  start-page: 346
  year: 2011
  end-page: 359
  ident: br0020
  article-title: Time-varying graphs and dynamic networks
  publication-title: Ad-Hoc, Mobile, and Wireless Networks
– volume: 9
  year: 2014
  ident: br0050
  article-title: Contact patterns among high school students
  publication-title: PLoS ONE
– volume: 279
  start-page: 287
  issue: 1
  year: 1998
  ident: 10.1016/j.tcs.2015.09.030_br0100
  article-title: A graph-theoretic algorithm for comparative modeling of protein structure
  publication-title: J. Mol. Biol.
  doi: 10.1006/jmbi.1998.1689
– start-page: 801
  year: 2014
  ident: 10.1016/j.tcs.2015.09.030_br0120
  article-title: Identifying roles in an IP network with temporal and structural density
– volume: 16
  issue: 9
  year: 1973
  ident: 10.1016/j.tcs.2015.09.030_br0010
  article-title: Algorithm 457: finding all cliques of an undirected graph
  publication-title: Commun. ACM
  doi: 10.1145/362342.362367
– volume: 407
  start-page: 564
  issue: 1–3
  year: 2008
  ident: 10.1016/j.tcs.2015.09.030_br0030
  article-title: A note on the problem of reporting maximal cliques
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2008.05.010
– volume: 18
  start-page: 3.1:3.1
  year: 2013
  ident: 10.1016/j.tcs.2015.09.030_br0040
  article-title: Listing all maximal cliques in large sparse real-world graphs
  publication-title: ACM J. Exp. Algorithmics
  doi: 10.1145/2543629
– ident: 10.1016/j.tcs.2015.09.030_br0130
– volume: 363
  start-page: 28
  year: 2006
  ident: 10.1016/j.tcs.2015.09.030_br0110
  article-title: The worst-case time complexity for generating all maximal cliques and computational experiments
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/j.tcs.2006.06.015
– year: 2014
  ident: 10.1016/j.tcs.2015.09.030_br0140
– volume: 519
  start-page: 97
  year: 2012
  ident: 10.1016/j.tcs.2015.09.030_br0060
  article-title: Temporal networks
  publication-title: Phys. Rep.
  doi: 10.1016/j.physrep.2012.03.001
– volume: 27
  start-page: 119
  issue: 3
  year: 1988
  ident: 10.1016/j.tcs.2015.09.030_br0070
  article-title: On generating all maximal independent sets
  publication-title: Inform. Process. Lett.
  doi: 10.1016/0020-0190(88)90065-8
– volume: 9
  year: 2014
  ident: 10.1016/j.tcs.2015.09.030_br0050
  article-title: Contact patterns among high school students
  publication-title: PLoS ONE
  doi: 10.1371/journal.pone.0107878
– volume: 250
  start-page: 1
  year: 2001
  ident: 10.1016/j.tcs.2015.09.030_br0080
  article-title: Enumerating all connected maximal common subgraphs in two graphs
  publication-title: Theoret. Comput. Sci.
  doi: 10.1016/S0304-3975(00)00286-3
– start-page: 109
  year: 2007
  ident: 10.1016/j.tcs.2015.09.030_br0090
  article-title: Automated social hierarchy detection through email network analysis
– volume: vol. 6811
  start-page: 346
  year: 2011
  ident: 10.1016/j.tcs.2015.09.030_br0020
  article-title: Time-varying graphs and dynamic networks
SSID ssj0000576
Score 2.5316336
Snippet •We introduce delta-cliques, that generalize graph cliques to link streams/time-varying graphs.•We provide a greedy algorithm to compute all delta-cliques of a...
A link stream is a collection of triplets indicating that an interaction occurred between u and v at time t. We generalize the classical notion of cliques in...
A link stream is a sequence of triplets $(t,u,v)$ indicating that an interaction occurred between $u$ and $v$ at time $t$. We generalize the classical notion...
SourceID hal
proquest
crossref
elsevier
SourceType Open Access Repository
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 245
SubjectTerms Algorithms
Cliques
Collection
Computation
Computer Science
Contact
Data Structures and Algorithms
Graphs
Intervals
Link streams
Links
Other
Streams
Temporal networks
Time-varying graphs
Title Computing maximal cliques in link streams
URI https://dx.doi.org/10.1016/j.tcs.2015.09.030
https://www.proquest.com/docview/1778043167
https://hal.science/hal-01112627
Volume 609
WOSCitedRecordID wos000367488400018&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1879-2294
  dateEnd: 20180131
  omitProxy: false
  ssIdentifier: ssj0000576
  issn: 0304-3975
  databaseCode: AIEXJ
  dateStart: 19950109
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3db9MwELfKxgM88DFAlC8FxAugTIkTx_ZjNQ0NNCakFdQ3y7k6NFWbVWtalf-ec-yk1SYmQOIliqzEse4ud_Z9_I6Qt5LLjCHfQ2AJhKk0RZjzFEKTZDFQM84TOm6aTfCzMzEaya-93nlbC7Oe8aoSm41c_FdW4xgy25bO_gW7u0lxAO-R6XhFtuP1jxjv-jRYD8Bcb8q5xf-YWZDWJvHVxmub-hDtUcqnnbR09YzgGz188Nax5cn3Urs8-GG5mOidePyprvXip6v8qetJaVZbP_ePqnSK7WjmYvLzbkrva4idr2Hra7xeBOMKr2xwRboGKIfG6VHBZUip61_cKtoskruqMmU7Vpc6HNtrCt35FqaHNVhs9Zg5UNpoa726nMJzuw67DNziRqiF8Ei8TzmTqOr2B5-OR5-3BppxF8L2626D3U3a35UP_W67cmti82avmO9mTzJ8QO75w0QwcELwkPRMdUDut406Aq-3D8jdLx047_IReddJSOAlJPASEpRVYCUk8BLymHz7eDw8Ogl9x4wQ8GBeh3wscqpFhqfsAmJmZJwnBeTUaB6lBve6AhhIneSMgywyyCU3RgsZ5ToHi1L8hOxVF5V5alPexjkFkXMtijQBoVOkChcMmARRQNInUUsYBR5O3nY1mak2b3CqkJbK0lJFUiEt--R998rCYanc9HDaUlt5cXebPIWicdNrb5Az3fQWPP1kcKrsGFqymGaUr1mfvG4Zp1Cb2hCZrszFaqlibgG5LDrEs3_7_nNyZ_vjvCB79eXKvCS3YV2Xy8tXXhJ_ATzdl_w
linkProvider Elsevier
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=Computing+maximal+cliques+in+link+streams&rft.jtitle=Theoretical+computer+science&rft.au=Viard%2C+Tiphaine&rft.au=Latapy%2C+Matthieu&rft.au=Magnien%2C+Cl%C3%A9mence&rft.date=2016-01-04&rft.pub=Elsevier+B.V&rft.issn=0304-3975&rft.eissn=1879-2294&rft.volume=609&rft.spage=245&rft.epage=252&rft_id=info:doi/10.1016%2Fj.tcs.2015.09.030&rft.externalDocID=S0304397515008701
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon