Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Esteban Pascual, Guillermo"'
Continuous 2-dimensional space is often discretized by considering a grid of weighted square cells. In this work we study how well a weighted tessellation approximates the space, with respect to shortest paths. In particular, we consider a shortest p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______3484::5cf33d4ff025c6c77c1f8a5bd9b2b644
https://hdl.handle.net/2117/385087
https://hdl.handle.net/2117/385087
Autor:
Esteban Pascual, Guillermo
Publikováno v:
Archivo Digital UPM
Universidad Politécnica de Madrid
Universidad Politécnica de Madrid
Some of the most studied problems in Graph Theory are those referring to the coloring of the graph, being one of the most famous the Three Color Problem. A color set D for a graph G is said to be a 3-coloring if adjacent vertex has a different color
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::a35a140933c5e50234f0a5317c4113a3
http://oa.upm.es/47115/
http://oa.upm.es/47115/
Autor:
Esteban Pascual, Guillermo
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
instname
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
We propose the study of counting problems for geometric graphs defined on point sets in convex position. Many formulae are known, for instance the numbers of triangulations are given by the Catalan numbers. Our approach to that topic is based on gene
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6ad6dd33d4191909c181a35251332de6
http://hdl.handle.net/2117/119372
http://hdl.handle.net/2117/119372