Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Configuracions i dissenys combinatoris"'
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
The problem of district design for the implementation of arc routing activities is addressed. The aim is to partition a road network into a given number of sectors to facilitate the organization of the operations to be implemented within the region.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07337a55e70ab39c7741437307f3082d
Autor:
Jaume Martí-Farré
Publikováno v:
Recercat. Dipósit de la Recerca de Catalunya
Universitat Jaume I
Scopus-Elsevier
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Jaume I
Scopus-Elsevier
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
This paper deals with the question of completing a monotone increasing family of subsets $\Gamma$ of a finite set $\Omega$ to obtain the dependent sets of a matroid. Specifically, we provide several natural processes for transforming the clutter $\La
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::aaafc869c8e4efa00e2b57ba66e1ebb1
https://doi.org/10.37236/3895
https://doi.org/10.37236/3895
Autor:
Jaume Martí-Farré
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
Universitat Jaume I
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
Universitat Jaume I
This paper deals with the question of completing a monotone increasing family of subsets of a finite set to obtain the linearly dependent subsets of a family of vectors of a vector space. Specifically, we demonstrate that such vectorial completions o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fd3b815334c1a7e2f5fcf95a7ca37c8c
http://hdl.handle.net/2117/27361
http://hdl.handle.net/2117/27361
Autor:
Bras Amorós, Maria, Stokes, Klara
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Universitat Politècnica de Catalunya (UPC)
A (v, b, r, k) combinatorial configuration can be defined as a connected, (r, k)-biregular bipartite graph with v vertices on one side and b vertices on the other and with no cycle of length 4. Combinatorial configurations have become very important
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::e8f2862b39706f742cc3d3570cc1ffec
https://hdl.handle.net/2099/10372
https://hdl.handle.net/2099/10372