RiuNet UPV Home
:
Browsing by Subject

Search RiuNet

Browse

All of RiuNet

My Account

RiuNet Help

Admin. UPV

Browsing by Subject "Graph theory"

Now showing items 1-20 of 24

Acceptance of reservations for a rent-a-car company

Conejero Casares, José Alberto; Jordan Lluch, Cristina; Sanabria Codesal, Esther (Interlude, 2012-12)

Airlines schedules can been modeled by using time-space networks. One of the core problems of the management of rent-a-car companies is to automate the process of the acceptance of vehicles reservations from the clients. ...
Algoritmos de detección de comunidades en grafos y aplicación en conjuntos de datos de tránsito en aeropuertos y trasvase de alumnos entre titulaciones de la UPV

Méndez Carmona, Alejandro (Universitat Politècnica de València, 2022-09-08)

[CA] Els avanços en teoria de grafs i anàlisi de xarxes complexes han estat fonamentals per a una millor comprensió dels sistemes complexos que poden aparèixer a la vida real. L’estructura comunitària és una de les ...
An algorithm for self-organization of driverless vehicles of a car-rental service

Conejero, J. Alberto; Jordan-Lluch, Cristina; Sanabria-Codesal, Esther (Springer Verlag (Germany), 2016-04)

[EN] The solution of fleet assignment problems is one of the core points in the management of a car-rental company. These problems arise from the restrictions imposed by the acceptance of reservations of the customers and ...
An Analysis of the Influence of Graph Theory When Preparing for Programming Contests

Jordan-Lluch, Cristina; Gomez, J.A.; Conejero, J. Alberto (MDPI AG, 2017)

[EN] The subject known as Programming Contests in the Bachelor's Degree in Computer Engineering course focuses on solving programming problems frequently met within contests such as the Southwest Europe Regional Contest ...
Aprendiendo a modelizar con grafos

Jordan-Lluch, Cristina; Sanabria-Codesal, Esther (Matemática Aplicada a la Ingeniería Civil ( MAIC), 2021-10-01)

[EN] In this work we present an activity included in the evaluation of some practices, whose contents are related to the graph theory and its multiple applications to real problems. We include some statements of the problems ...
Characterisation of the consistent completion of AHP comparison matrices using graph theory

Benítez López, Julio; Carpitella, Silvia; Certa, A.; Izquierdo Sebastián, Joaquín (John Wiley & Sons, 2019-01)

[EN] Decision-making is frequently affected by uncertainty and/or incomplete information, which turn decision-making into a complex task. It is often the case that some of the actors involved in decision-making are not ...
Colour image smoothing through a soft-switching mechanism using a graph model

Jordan Lluch, Cristina; Morillas, Samuel; Sanabria Codesal, Esther (Institution of Engineering and Technology (IET), 2012-12)

[EN] In this study, the authors propose a soft-switching ¿lter to improve the performance of recent colour image smoothing ¿lters when processing homogeneous image regions. The authors use a recent ¿lter mixed with the ...
Desarrollo de algoritmos de simplificación de modelos de redes de abastecimiento basados en la teoría de grafos y el uso del software EPANET 2.2

Aguilera Chamorro, Melany Marcela (Universitat Politècnica de València, 2021-10-21)

[ES] La modelación o uso de modelos es una herramienta muy común en el estudio de cualquier tipo de sistemas. Los modelos matemáticos son esquemas que buscan representar y reproducir, de la manera más fiel y completa ...
Divisibility networks of the rational numbers in the unit interval

Solares-Hernández, Pedro A.; Garcia March, Miguel Angel; Conejero, J. Alberto (MDPI AG, 2020-11)

[EN] Divisibility networks of natural numbers present a scale-free distribution as many other process in real life due to human interventions. This was quite unexpected since it is hard to find patterns concerning anything ...
Divisibility patterns within Pascal divisibility networks

Solares-Hernández, Pedro Antonio; Manzano, Fernando A.; Perez-Benito, Francisco Javier; Conejero, J. Alberto (MDPI AG, 2020-02)

[EN] The Pascal triangle is so simple and rich that it has always attracted the interest of professional and amateur mathematicians. Their coefficients satisfy a myriad of properties. Inspired by the work of Shekatkar et ...
Does wild rabbit population size affect connectivity?

Machado, Rui; Santos, Pedro (Universitat Politècnica de València, 2019-12-23)

[EN] Wild rabbit is a relevant species in the Iberian Peninsula due to its ecological and economic roles. Conservationists and game managers therefore have a shared interest in assuring the existence of resilient and ...
Herramientas de ayuda a la sectorización de redes de abastecimiento de agua basadas en la teoría de grafos aplicando distintos criterios

Vegas Niño, Óscar Tomás (Universitat Politècnica de València, 2012-11-30)

[ES] En muchas ciudades del mundo hoy en día se apoyan en herramientas de sectorización para dividir la red en sectores más pequeños y así poder tener un mejor control del tránsito del agua por las tuberías. Físicamente ...
iDistritos: Sectorización de modelos de redes hidráulicas de Epanet

Vegas, O.; Martínez Alzamora, Fernando; Tzatchkov, V. (International Association for Hydro-Environment Engineering and Research (IAHR), 2021)

[ES] La sectorización de una red de suministro de agua es una técnica muy utilizada para mejorar la eficiencia hidráulica del sistema (localización de fugas, gestión de la presión, etc.). Numerosas metodologías se han ...
Implementation of DMAs in Intermittent Water Supply Networks Based on Equity Criteria

Ilaya-Ayza, Amilkar Ernesto; Martins-Alves, Carlos; Campbell-Gonzalez, Enrique; Izquierdo Sebastián, Joaquín (MDPI AG, 2017)

[EN] Intermittent supply is a common way of delivering water in many developing countries. Limitations on water and economic resources, in addition to poor management and population growth, limit the possibilities of ...
Implementing MAS agreement processes based on consensus networks

Palomares Chust, Alberto; Carrascosa Casamayor, Carlos; Rebollo Pedruelo, Miguel; Gómez, Yolanda (Springer Verlag, 2013)

[EN] Consensus is a negotiation process where agents need to agree upon certain quantities of interest. The theoretical framework for solving consensus problems in dynamic networks of agents was formally introduced by ...
Interconnection Architecture of Proximity Smart IoE-Networks with Centralised Management

González Ramírez, Pedro Luis (Universitat Politècnica de València, 2022-04-07)

[ES] La interoperabilidad entre los objetos comunicados es el objetivo principal del internet de las cosas (IoT). Algunos esfuerzos para lograrlo han generado diversas propuestas de arquitecturas, sin embargo, aún no se ...
IoT-Networks group-based model that uses AI for workgroup allocation

González Ramírez, Pedro Luis; Lloret, Jaime; Tomás Gironés, Jesús; Hurtado, Mikel (Elsevier, 2021-02-26)

[EN] This paper presents a centralized management architecture model for designing workgroup-based Internet of Things (IoT) and Internet of Everything (IoE) networks. The architecture establishes the organization of an ...
Multi-Agent Adaptive Boosting on Semi-Supervised Water Supply Clusters

Herrera Fernández, Antonio Manuel; Izquierdo Sebastián, Joaquín; Pérez García, Rafael; Montalvo Arango, Idel (ELSEVIER SCI LTD, 2012)

[EN] The division of a water supply network (WSN) into isolated supply clusters aims at improving the management of the whole system. This paper deals with the application of spectral clustering to achieve this aim. A ...
Nuevas contribuciones a la teoría y aplicación del procesado de señal sobre grafos

Belda Valls, Jordi (Universitat Politècnica de València, 2023-01-16)

[ES] El procesado de señal sobre grafos es un campo emergente de técnicas que combinan conceptos de dos áreas muy consolidadas: el procesado de señal y la teoría de grafos. Desde la perspectiva del procesado de señal puede ...
On graphs associated to sets of rankings

Criado Herrero, Regino; García, Esther; Pedroche Sánchez, Francisco; Romance, Miguel (Elsevier, 2016-01-01)

In this paper we analyze families of rankings by studying structural properties of graphs. Given a finite number of elements and a set of rankings of those elements, two elements compete when they exchange their relative ...