Mostra el registre d'ítem simple

dc.contributor.authorLópez Masip, Susana Clara
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Matemàtiques
dc.date.accessioned2017-12-11T09:01:44Z
dc.date.available2017-12-11T09:01:44Z
dc.date.issued2017
dc.identifier.citationLópez, S.C. Characterizing path-like trees from linear configurations. A: British Combinatorial Conference. "26st British Combinatorial Conference: University of Strathclyde, 3th-7th july 2017: abstract booklet". Glasgow: 2017, p. 58.
dc.identifier.urihttp://hdl.handle.net/2117/111640
dc.description.abstractAssume that we embed the path Pn as a subgraph of a 2-dimensional grid, namely, Pk¿Pl. Given such an embedding, we consider the ordered set of subpaths L1, L2,...,Lm which are maximal straight segments in the embedding, and such that the end of Li is the beginning of Li+1.
dc.format.extent1 p.
dc.language.isoeng
dc.rightsAttribution-NonCommercial-NoDerivs 3.0 Spain
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/3.0/es/
dc.subjectÀrees temàtiques de la UPC::Matemàtiques i estadística
dc.subject.lcshNumerical calculations
dc.subject.otherLinear configurations
dc.titleCharacterizing path-like trees from linear configurations
dc.typeConference lecture
dc.subject.lemacCàlcul de variacions
dc.contributor.groupUniversitat Politècnica de Catalunya. COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
dc.relation.publisherversionhttp://combinatorics.cis.strath.ac.uk/bcc2017/AbstractBooklet.pdf
dc.rights.accessOpen Access
local.identifier.drac21576272
dc.description.versionPostprint (updated version)
local.citation.authorLópez, S.C.
local.citation.contributorBritish Combinatorial Conference
local.citation.pubplaceGlasgow
local.citation.publicationName26st British Combinatorial Conference: University of Strathclyde, 3th-7th july 2017: abstract booklet
local.citation.startingPage58
local.citation.endingPage58


Fitxers d'aquest items

Thumbnail
Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple