Titel

Merkliste
1 Ergebnisse

Efficiently Enumerating Minimal Triangulations:

, In: Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems,

Carmeli, Nofar ; Kenig, Batya ; Kimelfeld, Benny - p. 273-287 , 2017

Link: https://dl.acm.org/doi/10.1145/3034786.3056109

RT 
T1 <cTitle>Proceedings of the 36th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems</cTitle>: T1 <Title>Efficiently Enumerating Minimal Triangulations</Title>

UL https://suche.suub.uni-bremen.de/peid=acm-3056109&Exemplar=1&LAN=DE
				
A1 Carmeli, Nofar
A1 Kenig, Batya
A1 Kimelfeld, Benny
PB ACM
YR 2017
K1 enumeration algorithm
K1 maximal cliques
K1 maximal independent sets
K1 minimal separators
K1 minimal triangulation
K1 tree decomposition
K1 Mathematics of computing
K1 Discrete mathematics
K1 Combinatorics
K1 Enumeration
K1 Graph theory
K1 Graph enumeration
K1 Graph algorithms
K1 Probability and statistics
K1 Probabilistic inference problems
K1 Bayesian computation
K1 Information systems
K1 Data management systems
K1 Database management system engines
K1 Database query processing
K1 Query optimization
K1 Join algorithms
SP 273
OP 287
LK http://dx.doi.org/https://dl.acm.org/doi/10.1145/3034786.3056109
DO https://dl.acm.org/doi/10.1145/3034786.3056109
SF ELIB - SuUB Bremen

Export

RefWorks (nur Desktop-Version!)
Flow (Zuerst in Flow einloggen, dann importieren)