Hochschulschrift
A Riemann-Roch theory for sublattices of the root lattice An, graph automorphisms and counting cycles in graphs
- Alternative title
-
Riemann-Roch-Theorie für Untergitter des Wurzelgitter, Graphen-Automorphie und Zählen von Zyklen in Graphen
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Saarbrücken, Universität des Saarlandes, Diss., 2011
- Classification
-
Mathematik
- Keyword
-
Riemann-Roch-Satz ; Gitter , Graph ; Automorphismus
- Event
-
Veröffentlichung
- (where)
-
Saarbrücken
- (who)
-
Saarländische Universitäts- und Landesbibliothek
- (when)
-
2012
- Creator
-
Manjunath, Madhusudan
- Contributor
- URN
-
urn:nbn:de:bsz:291-scidok-47818
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:47 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.
Object type
- Hochschulschrift
Associated
- Manjunath, Madhusudan
- Mehlhorn, Kurt
- Saarländische Universitäts- und Landesbibliothek
Time of origin
- 2012
Other Objects (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
Riemann-Roch algebra
LINE GRAPHS, THEIR DESARGUESIAN CLOSURES, AND CORRESPONDING GROUPS OF AUTOMORPHISMS
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
Riemann-Roch algebra
LINE GRAPHS, THEIR DESARGUESIAN CLOSURES, AND CORRESPONDING GROUPS OF AUTOMORPHISMS
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
Riemann-Roch algebra
LINE GRAPHS, THEIR DESARGUESIAN CLOSURES, AND CORRESPONDING GROUPS OF AUTOMORPHISMS
Dave Collier, Grafiken zu"Rat Experiments: Collagen Graphs(I) und Platelet Counting Counting Graphs(II) in vivo"