Homomorphism thresholds and embeddings of spanning subgraphs in dense graphs

to connected objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Notes: Hamburg, Universität Hamburg, Dissertation, 2021

Keyword: Kombinatorik
Diskrete Mathematik
Graphentheorie
Kombinatorische Graphentheorie
Kreis
Taillenweite

Event: Veröffentlichung

(where): Hamburg

(who): Staats- und Universitätsbibliothek Hamburg Carl von Ossietzky

(when): 2020

Creator: Ebsen, Oliver

URN: urn:nbn:de:gbv:18-ediss-94802

Rights: Open Access; Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 25.03.2025, 1:53 PM CET

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Ebsen, Oliver
Staats- und Universitätsbibliothek Hamburg Carl von Ossietzky

Time of origin

2020

Other Objects (12)

Foldingfree coverings and graph embeddings

Leveraging literals for knowledge graph embeddings

Graph Embeddings Motivated by Greedy Routing

Embedding spanning bounded degree graphs in randomly perturbed graphs

Spanning structures in random graphs and hypergraphs

zweidimensionales bewegtes Bild

Shortest path embeddings of graphs on surfaces

Embeddings and decompositions of graphs and hypergraphs

Knowledge graph embeddings: open challenges and opportunities

Hochschulschrift

Efficient embeddings of treelike graphs into hypercubes

RDF2Vec: RDF graph embeddings for data mining

Knowledge graph embeddings: link prediction and beyond

KGvec2go – Knowledge graph embeddings as a service

Foldingfree coverings and graph embeddings

Leveraging literals for knowledge graph embeddings

Graph Embeddings Motivated by Greedy Routing

Embedding spanning bounded degree graphs in randomly perturbed graphs

Spanning structures in random graphs and hypergraphs

zweidimensionales bewegtes Bild

Shortest path embeddings of graphs on surfaces

Embeddings and decompositions of graphs and hypergraphs

Knowledge graph embeddings: open challenges and opportunities

Hochschulschrift

Efficient embeddings of treelike graphs into hypercubes

RDF2Vec: RDF graph embeddings for data mining

Knowledge graph embeddings: link prediction and beyond

KGvec2go – Knowledge graph embeddings as a service

Foldingfree coverings and graph embeddings

Leveraging literals for knowledge graph embeddings

Graph Embeddings Motivated by Greedy Routing

Embedding spanning bounded degree graphs in randomly perturbed graphs

Spanning structures in random graphs and hypergraphs

zweidimensionales bewegtes Bild

Shortest path embeddings of graphs on surfaces

Embeddings and decompositions of graphs and hypergraphs

Knowledge graph embeddings: open challenges and opportunities

Hochschulschrift

Efficient embeddings of treelike graphs into hypercubes

RDF2Vec: RDF graph embeddings for data mining

Knowledge graph embeddings: link prediction and beyond

KGvec2go – Knowledge graph embeddings as a service

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Homomorphism thresholds and embeddings of spanning subgraphs in dense graphs

Object Details

Classification and Topics

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

Foldingfree coverings and graph embeddings

Leveraging literals for knowledge graph embeddings

Graph Embeddings Motivated by Greedy Routing

Embedding spanning bounded degree graphs in randomly perturbed graphs

Spanning structures in random graphs and hypergraphs

Shortest path embeddings of graphs on surfaces

Embeddings and decompositions of graphs and hypergraphs

Knowledge graph embeddings: open challenges and opportunities

Efficient embeddings of treelike graphs into hypercubes

RDF2Vec: RDF graph embeddings for data mining

Knowledge graph embeddings: link prediction and beyond

KGvec2go – Knowledge graph embeddings as a service

Foldingfree coverings and graph embeddings

Leveraging literals for knowledge graph embeddings

Graph Embeddings Motivated by Greedy Routing

Embedding spanning bounded degree graphs in randomly perturbed graphs

Spanning structures in random graphs and hypergraphs

Shortest path embeddings of graphs on surfaces

Embeddings and decompositions of graphs and hypergraphs

Knowledge graph embeddings: open challenges and opportunities

Efficient embeddings of treelike graphs into hypercubes

RDF2Vec: RDF graph embeddings for data mining

Knowledge graph embeddings: link prediction and beyond

KGvec2go – Knowledge graph embeddings as a service

Foldingfree coverings and graph embeddings

Leveraging literals for knowledge graph embeddings

Graph Embeddings Motivated by Greedy Routing

Embedding spanning bounded degree graphs in randomly perturbed graphs

Spanning structures in random graphs and hypergraphs

Shortest path embeddings of graphs on surfaces

Embeddings and decompositions of graphs and hypergraphs

Knowledge graph embeddings: open challenges and opportunities

Efficient embeddings of treelike graphs into hypercubes

RDF2Vec: RDF graph embeddings for data mining

Knowledge graph embeddings: link prediction and beyond

KGvec2go – Knowledge graph embeddings as a service

Related objects

Reset password