Conflict-free connection numbers of line graphs

A path in an edge-colored graph is called \emph{conflict-free} if it contains at least one color used on exactly one of its edges. An edge-colored graph $G$ is \emph{conflict-free connected} if for any two distinct vertices of $G$, there is a conflict-free path connecting them. For a connected graph $G$, the \emph{conflict-free connection number} of $G$, denoted by $cfc(G)$, is defined as the minimum number of colors that are required to make $G$ conflict-free connected. In this paper, we investigate the conflict-free connection numbers of connected claw-free graphs, especially line graphs. We first show that for an arbitrary connected graph $G$, there exists a positive integer $k$ such that $cfc(L^k(G))\leq 2$. Secondly, we get the exact value of the conflict-free connection number of a connected claw-free graph, especially a connected line graph. Thirdly, we prove that for an arbitrary connected graph $G$ and an arbitrary positive integer $k$, we always have $cfc(L^{k+1}(G))\leq cfc(L^k(G))$, with only the exception that $G$ is isomorphic to a star of order at least~$5$ and $k=1$. Finally, we obtain the exact values of $cfc(L^k(G))$, and use them as an efficient tool to get the smallest nonnegative integer $k_0$ such that $cfc(L^{k_0}(G))=2$.Comment: 11 page

Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time

We present faster algorithms for computing the 2-edge and 2-vertex strongly connected components of a directed graph, which are straightforward generalizations of strongly connected components. While in undirected graphs the 2-edge and 2-vertex connected components can be found in linear time, in directed graphs only rather simple $O(m n)$-time algorithms were known. We use a hierarchical sparsification technique to obtain algorithms that run in time $O(n^2)$. For 2-edge strongly connected components our algorithm gives the first running time improvement in 20 years. Additionally we present an $O(m^2 / \log{n})$-time algorithm for 2-edge strongly connected components, and thus improve over the $O(m n)$ running time also when $m = O(n)$. Our approach extends to k-edge and k-vertex strongly connected components for any constant k with a running time of $O(n^2 \log^2 n)$ for edges and $O(n^3)$ for vertices

Network conduciveness with application to the graph-coloring and independent-set optimization transitions

We introduce the notion of a network's conduciveness, a probabilistically interpretable measure of how the network's structure allows it to be conducive to roaming agents, in certain conditions, from one portion of the network to another. We exemplify its use through an application to the two problems in combinatorial optimization that, given an undirected graph, ask that its so-called chromatic and independence numbers be found. Though NP-hard, when solved on sequences of expanding random graphs there appear marked transitions at which optimal solutions can be obtained substantially more easily than right before them. We demonstrate that these phenomena can be understood by resorting to the network that represents the solution space of the problems for each graph and examining its conduciveness between the non-optimal solutions and the optimal ones. At the said transitions, this network becomes strikingly more conducive in the direction of the optimal solutions than it was just before them, while at the same time becoming less conducive in the opposite direction. We believe that, besides becoming useful also in other areas in which network theory has a role to play, network conduciveness may become instrumental in helping clarify further issues related to NP-hardness that remain poorly understood

Distributed Ledger for Provenance Tracking of Artificial Intelligence Assets

High availability of data is responsible for the current trends in Artificial Intelligence (AI) and Machine Learning (ML). However, high-grade datasets are reluctantly shared between actors because of lacking trust and fear of losing control. Provenance tracing systems are a possible measure to build trust by improving transparency. Especially the tracing of AI assets along complete AI value chains bears various challenges such as trust, privacy, confidentiality, traceability, and fair remuneration. In this paper we design a graph-based provenance model for AI assets and their relations within an AI value chain. Moreover, we propose a protocol to exchange AI assets securely to selected parties. The provenance model and exchange protocol are then combined and implemented as a smart contract on a permission-less blockchain. We show how the smart contract enables the tracing of AI assets in an existing industry use case while solving all challenges. Consequently, our smart contract helps to increase traceability and transparency, encourages trust between actors and thus fosters collaboration between them

The generalized 3-edge-connectivity of lexicographic product graphs

The generalized $k$-edge-connectivity $\lambda_k(G)$ of a graph $G$ is a generalization of the concept of edge-connectivity. The lexicographic product of two graphs $G$ and $H$, denoted by $G\circ H$, is an important graph product. In this paper, we mainly study the generalized 3-edge-connectivity of $G \circ H$, and get upper and lower bounds of $\lambda_3(G \circ H)$. Moreover, all bounds are sharp.Comment: 14 page

Approximate min-max relations on plane graphs

Let G be a plane graph, let τ(G) (resp. τ′(G)) be the minimum number of vertices (resp. edges) that meet all cycles of G, and let ν(G) (resp. ν′(G)) be the maximum number of vertex-disjoint (resp. edge-disjoint) cycles in G. In this note we show that τ(G)≤3 ν(G) and τ′(G)≤4 ν′(G)-1; our proofs are constructive, which yield polynomial-time algorithms for finding corresponding objects with the desired properties. © 2011 The Author(s).published_or_final_versionSpringer Open Choice, 28 May 201

A Computational Approach for Designing Tiger Corridors in India

Wildlife corridors are components of landscapes, which facilitate the movement of organisms and processes between intact habitat areas, and thus provide connectivity between the habitats within the landscapes. Corridors are thus regions within a given landscape that connect fragmented habitat patches within the landscape. The major concern of designing corridors as a conservation strategy is primarily to counter, and to the extent possible, mitigate the effects of habitat fragmentation and loss on the biodiversity of the landscape, as well as support continuance of land use for essential local and global economic activities in the region of reference. In this paper, we use game theory, graph theory, membership functions and chain code algorithm to model and design a set of wildlife corridors with tiger (Panthera tigris tigris) as the focal species. We identify the parameters which would affect the tiger population in a landscape complex and using the presence of these identified parameters construct a graph using the habitat patches supporting tiger presence in the landscape complex as vertices and the possible paths between them as edges. The passage of tigers through the possible paths have been modelled as an Assurance game, with tigers as an individual player. The game is played recursively as the tiger passes through each grid considered for the model. The iteration causes the tiger to choose the most suitable path signifying the emergence of adaptability. As a formal explanation of the game, we model this interaction of tiger with the parameters as deterministic finite automata, whose transition function is obtained by the game payoff.Comment: 12 pages, 5 figures, 6 tables, NGCT conference 201

On the formal foundations of cash management systems

[EN] Cash management aims to find a balance between what is held in cash and what is allocated in other investments in exchange for a given return. Dealing with cash management systems with multiple accounts and different links between them is a complex task. Current cash management models provide analytic solutions without exploring the underlying structure of accounts and its main properties. There is a need for a formal definition of cash management systems. In this work, we introduce a formal approach to manage cash with multiple accounts based on graph theory. Our approach allows a formal reasoning on the relation between accounts in cash management systems. A critical part of this formal reasoning is the characterization of desirable and non-desirable cash management policies. Novel theoretical results guide cash managers in the analysis of complex cash management systems.This work is partially funded by projects Logistar (H2020-769142), AI4EU (H2020-825619) and 2017 SGR 172.Salas-Molina, F.; Rodriguez-Aguilar, JA.; Pla Santamaría, D.; Garcia-Bernabeu, A. (2021). On the formal foundations of cash management systems. Operational Research. 21(2):1081-1095. https://doi.org/10.1007/s12351-019-00464-6S10811095212Baccarin S (2009) Optimal impulse control for a multidimensional cash management system with generalized cost functions. Eur J Oper Res 196(1):198–206Bollobás B (2013) Modern graph theory, vol 184. Springer, BerlinBondy JA, Murty USR (1976) Graph theory with applications, vol 290. Macmillan, LondonChartrand G, Oellermann OR (1993) Applied and algorithmic graph theory, vol 993. McGraw-Hill, New YorkConstantinides GM, Richard SF (1978) Existence of optimal simple policies for discounted-cost inventory and cash management in continuous time. Oper Res 26(4):620–636da Costa Moraes MB, Nagano MS, Sobreiro VA (2015) Stochastic cash flow management models: a literature review since the 1980s. In: Guarnieri P (ed) Decision models in engineering and management. Springer, Berlin, pp 11–28de Avila Pacheco JV, Morabito R (2011) Application of network flow models for the cash management of an agribusiness company. Comput Ind Eng 61(3):848–857Golden B, Liberatore M, Lieberman C (1979) Models and solution techniques for cash flow management. Comput Oper Res 6(1):13–20Gormley FM, Meade N (2007) The utility of cash flow forecasts in the management of corporate cash balances. Eur J Oper Res 182(2):923–935Gregory G (1976) Cash flow models: a review. Omega 4(6):643–656Makridakis S, Wheelwright SC, Hyndman RJ (2008) Forecasting methods and applications. Wiley, New YorkRighetto GM, Morabito R, Alem D (2016) A robust optimization approach for cash flow management in stationery companies. Comput Ind Eng 99:137–152Salas-Molina F (2017) Risk-sensitive control of cash management systems. Oper Res. https://doi.org/10.1007/s12351-017-0371-0Salas-Molina F, Pla-Santamaria D, Rodriguez-Aguilar JA (2018) A multi-objective approach to the cash management problem. Ann Oper Res 267(1):515–529Srinivasan V, Kim YH (1986) Deterministic cash flow management: state of the art and research directions. Omega 14(2):145–166Valiente G (2013) Algorithms on trees and graphs. Springer, Berli

ERP Conceptual Ecology

The technological evolution of recent years has made that information systems frequently adapt to the market realities to fulfill the improvements of the company’s organizational processes. In this context, new paradigms, approaches, and concepts were disseminated through the new realities of information systems. This study aims to verify how ERP (Enterprise Resource Planning) has been related to other information systems within its ecosystem. For this purpose, we have reviewed the literature based on 650 publications whose central theme was the ERP. The data were treated through a graphical analysis, inspired by SNA (Social Network Analysis), represented by related ERP concepts. The study results, determine the connection degree between the concepts that emerged with the technological evolution and the ERP, thus representing the ERP interoperability tendencies, over the last years. The study concludes that ERPs have been improving and substantially increasing the conditions of nteroperability with other information systems and with new organizational concepts that have emerged through the technological availability. This fact led to a better organizational process’s adoption and more organizational performance.info:eu-repo/semantics/publishedVersio