FlavorGraph: a large-scale food-chemical graph for generating food representations and recommending food pairings
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2045-2322
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
online resource.
- Erschienen in
-
FlavorGraph: a large-scale food-chemical graph for generating food representations and recommending food pairings ; volume:11 ; number:1 ; day:13 ; month:1 ; year:2021 ; pages:1-13 ; date:12.2021
Scientific reports ; 11, Heft 1 (13.1.2021), 1-13, 12.2021
- Urheber
-
Park, Donghyeon
Kim, Keonwoo
Kim, Seoyoon
Spranger, Michael
Kang, Jaewoo
- Beteiligte Personen und Organisationen
-
SpringerLink (Online service)
- DOI
-
10.1038/s41598-020-79422-8
- URN
-
urn:nbn:de:101:1-2021020722264818950156
- Rechteinformation
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:36 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Park, Donghyeon
- Kim, Keonwoo
- Kim, Seoyoon
- Spranger, Michael
- Kang, Jaewoo
- SpringerLink (Online service)
Ähnliche Objekte (12)
Fast algorithms for decomposable graphs
Fast algorithms for decomposable graphs
A comprehensive survey of fast graph clustering
Asymptotic behaviour of fast diffusions on graphs
Maximale Flüsse in fast-planaren Graphen : = Maximum flows in nearly planar graphs
Fast approximation algorithms for Steiner's problem in graphs
Slow convergance of graphs under mean curvature flow
Slow convergence of graphs under mean curvature flow
Fast construction of voxel-level functional connectivity graphs
A Fast Layout Algorithm for k-Level Graphs
Surge: a fast open-source chemical graph generator
Density of states for fast embedding node-attributed graphs
Fast algorithms for decomposable graphs
Fast algorithms for decomposable graphs
A comprehensive survey of fast graph clustering
Asymptotic behaviour of fast diffusions on graphs
Maximale Flüsse in fast-planaren Graphen : = Maximum flows in nearly planar graphs
Fast approximation algorithms for Steiner's problem in graphs
Slow convergance of graphs under mean curvature flow
Slow convergence of graphs under mean curvature flow
Fast construction of voxel-level functional connectivity graphs
A Fast Layout Algorithm for k-Level Graphs
Surge: a fast open-source chemical graph generator
Density of states for fast embedding node-attributed graphs
Fast algorithms for decomposable graphs
Fast algorithms for decomposable graphs
A comprehensive survey of fast graph clustering
Asymptotic behaviour of fast diffusions on graphs
Maximale Flüsse in fast-planaren Graphen : = Maximum flows in nearly planar graphs
Fast approximation algorithms for Steiner's problem in graphs
Slow convergance of graphs under mean curvature flow
Slow convergence of graphs under mean curvature flow
Fast construction of voxel-level functional connectivity graphs
A Fast Layout Algorithm for k-Level Graphs
Surge: a fast open-source chemical graph generator