FlavorGraph: a large-scale food-chemical graph for generating food representations and recommending food pairings
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2045-2322
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
online resource.
- Bibliographic citation
-
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
- Creator
-
Park, Donghyeon
Kim, Keonwoo
Kim, Seoyoon
Spranger, Michael
Kang, Jaewoo
- Contributor
-
SpringerLink (Online service)
- DOI
-
10.1038/s41598-020-79422-8
- URN
-
urn:nbn:de:101:1-2021020722264818950156
- Rights
-
Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:36 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Park, Donghyeon
- Kim, Keonwoo
- Kim, Seoyoon
- Spranger, Michael
- Kang, Jaewoo
- SpringerLink (Online service)
Other Objects (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
Fast construction of voxel-level functional connectivity graphs
Surge: a fast open-source chemical graph generator
Slow convergence of graphs under mean curvature flow
A Fast Layout Algorithm for k-Level Graphs
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
Fast construction of voxel-level functional connectivity graphs
Surge: a fast open-source chemical graph generator
Slow convergence of graphs under mean curvature flow
A Fast Layout Algorithm for k-Level Graphs
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
Fast construction of voxel-level functional connectivity graphs
Surge: a fast open-source chemical graph generator
Slow convergence of graphs under mean curvature flow
A Fast Layout Algorithm for k-Level Graphs