Monografie
Embedding large graphs : the Bollobás-Komlós conjecture and beyond
- Sprache
-
Englisch
- Anmerkungen
-
München, Techn. Univ., Diss., 2009
- Identifier
-
996564632
- Thema
-
Hochschulschrift
- Beteiligte Personen und Organisationen
- URN
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
26.01.2023, 13:55 MEZ
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.
Objekttyp
- Monografie
Beteiligte
Ähnliche Objekte (12)
On the implicit graph conjecture
Finite-dimensional approximations of quantum systems and Connes' embedding conjecture
Embedding spanning bounded degree graphs in randomly perturbed graphs
Separable graphs, minors and the reconstruction conjecture
Knowledge graph embedding for data mining vs. knowledge graph embedding for link prediction – two sides of the same coin?
Embedding Based Link Prediction for Knowledge Graph Completion
The complexity of embedding graphs into binary trees
Graph Embedding, Content Understanding, and Self-Supervised Learning
Edgar: the Embedding-baseD GrAph MineR
Universal preprocessing operators for embedding knowledge graphs with literals
Embedding/Maintaining SpiderMonkey in a large scale project
Using Graph Embedding Techniques in Process-Oriented Case-Based Reasoning
On the implicit graph conjecture
Finite-dimensional approximations of quantum systems and Connes' embedding conjecture
Embedding spanning bounded degree graphs in randomly perturbed graphs
Separable graphs, minors and the reconstruction conjecture
Knowledge graph embedding for data mining vs. knowledge graph embedding for link prediction – two sides of the same coin?
Embedding Based Link Prediction for Knowledge Graph Completion
The complexity of embedding graphs into binary trees
Graph Embedding, Content Understanding, and Self-Supervised Learning
Edgar: the Embedding-baseD GrAph MineR
Universal preprocessing operators for embedding knowledge graphs with literals
Embedding/Maintaining SpiderMonkey in a large scale project
Using Graph Embedding Techniques in Process-Oriented Case-Based Reasoning
On the implicit graph conjecture
Finite-dimensional approximations of quantum systems and Connes' embedding conjecture
Embedding spanning bounded degree graphs in randomly perturbed graphs
Separable graphs, minors and the reconstruction conjecture
Knowledge graph embedding for data mining vs. knowledge graph embedding for link prediction – two sides of the same coin?
Embedding Based Link Prediction for Knowledge Graph Completion
The complexity of embedding graphs into binary trees
Graph Embedding, Content Understanding, and Self-Supervised Learning
Edgar: the Embedding-baseD GrAph MineR
Universal preprocessing operators for embedding knowledge graphs with literals
Embedding/Maintaining SpiderMonkey in a large scale project