Hochschulschrift
A Riemann-Roch theory for sublattices of the root lattice An, graph automorphisms and counting cycles in graphs
- Weitere Titel
-
Riemann-Roch-Theorie für Untergitter des Wurzelgitter, Graphen-Automorphie und Zählen von Zyklen in Graphen
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Saarbrücken, Universität des Saarlandes, Diss., 2011
- Klassifikation
-
Mathematik
- Schlagwort
-
Riemann-Roch-Satz ; Gitter , Graph ; Automorphismus
- Ereignis
-
Veröffentlichung
- (wo)
-
Saarbrücken
- (wer)
-
Saarländische Universitäts- und Landesbibliothek
- (wann)
-
2012
- Urheber
-
Manjunath, Madhusudan
- Beteiligte Personen und Organisationen
- URN
-
urn:nbn:de:bsz:291-scidok-47818
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:47 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.
Objekttyp
- Hochschulschrift
Beteiligte
- Manjunath, Madhusudan
- Mehlhorn, Kurt
- Saarländische Universitäts- und Landesbibliothek
Entstanden
- 2012
Ähnliche Objekte (12)
Graph automorphisms for compression
Graph sampling for subgraph counting on directed graphs
Distinguishing vertices of a graph: automorphisms and palettes
Some counting problems in graphs
Cubic Vertex-Transitive Graphs Admitting Automorphisms of Large Order
Graph sparsification techniques for triangle counting
Counting patterns in strings and graphs
Motif Counting in Preferential Attachment Graphs
LINE GRAPHS, THEIR DESARGUESIAN CLOSURES, AND CORRESPONDING GROUPS OF AUTOMORPHISMS
Riemann-Roch algebra
Dave Collier, Grafiken zu"Rat Experiments: Collagen Graphs(I) und Platelet Counting Counting Graphs(II) in vivo"
Faster algorithms for counting subgraphs in sparse graphs
Graph automorphisms for compression
Graph sampling for subgraph counting on directed graphs
Distinguishing vertices of a graph: automorphisms and palettes
Some counting problems in graphs
Cubic Vertex-Transitive Graphs Admitting Automorphisms of Large Order
Graph sparsification techniques for triangle counting
Counting patterns in strings and graphs
Motif Counting in Preferential Attachment Graphs
LINE GRAPHS, THEIR DESARGUESIAN CLOSURES, AND CORRESPONDING GROUPS OF AUTOMORPHISMS
Riemann-Roch algebra
Dave Collier, Grafiken zu"Rat Experiments: Collagen Graphs(I) und Platelet Counting Counting Graphs(II) in vivo"
Faster algorithms for counting subgraphs in sparse graphs
Graph automorphisms for compression
Graph sampling for subgraph counting on directed graphs
Distinguishing vertices of a graph: automorphisms and palettes
Some counting problems in graphs
Cubic Vertex-Transitive Graphs Admitting Automorphisms of Large Order
Graph sparsification techniques for triangle counting
Counting patterns in strings and graphs
Motif Counting in Preferential Attachment Graphs
LINE GRAPHS, THEIR DESARGUESIAN CLOSURES, AND CORRESPONDING GROUPS OF AUTOMORPHISMS
Riemann-Roch algebra
Dave Collier, Grafiken zu"Rat Experiments: Collagen Graphs(I) und Platelet Counting Counting Graphs(II) in vivo"