Logo del repository
  1. Home
 
Opzioni

Counting Realizations of Laman Graphs on the Sphere

GALLET M
•
GRASEGGER G
•
SCHICHO J
2020
  • journal article

Periodico
ELECTRONIC JOURNAL OF COMBINATORICS
Abstract
We present an algorithm that computes the number of realizations of a Laman graph on a sphere for a general choice of the angles between the vertices. The algorithm is based on the interpretation of such a realization as a point in the moduli space of stable curves of genus zero with marked points, and on the explicit description, due to Keel, of the Chow ring of this space.
DOI
10.37236/8548
WOS
WOS:000526057500005
Archivio
https://hdl.handle.net/11368/3037694
info:eu-repo/semantics/altIdentifier/scopus/2-s2.0-85083586165
https://www.combinatorics.org/ojs/index.php/eljc/article/view/v27i2p5
Diritti
open access
license:creative commons
license uri:http://creativecommons.org/licenses/by-nd/4.0/
FVG url
https://arts.units.it/bitstream/11368/3037694/1/Counting realizations of Laman graphs on the sphere.pdf
Soggetti
  • Laman graph

  • sphere

  • count

google-scholar
Get Involved!
  • Source Code
  • Documentation
  • Slack Channel
Make it your own

DSpace-CRIS can be extensively configured to meet your needs. Decide which information need to be collected and available with fine-grained security. Start updating the theme to match your nstitution's web identity.

Need professional help?

The original creators of DSpace-CRIS at 4Science can take your project to the next level, get in touch!

Realizzato con Software DSpace-CRIS - Estensione mantenuta e ottimizzata da 4Science

  • Impostazioni dei cookie
  • Informativa sulla privacy
  • Accordo con l'utente finale
  • Invia il tuo Feedback