An Algorithm for Scaling Matrices and Computing the Minimum Cycle Mean in a Digraph.
An algorithm to construct greedy drawings of triangulations.
An Algorithm To Recognize A Generalized Line Graph And Output It's Root Graph
An algorithmic Friedman-Pippenger theorem on tree embeddings and applications.
An almost naive algorithm for finding relative neighbourhood graphs in metrics
An alternative construction of normal numbers
A new class of -adic normal numbers is built recursively by using Eulerian paths in a sequence of de Bruijn digraphs. In this recursion, a path is constructed as an extension of the previous one, in such way that the -adic block determined by the path contains the maximal number of different -adic subblocks of consecutive lengths in the most compact arrangement. Any source of redundancy is avoided at every step. Our recursive construction is an alternative to the several well-known concatenative...
An analogon of the fixed-point theorem and its application for graphs
An anti-Ramsey condition on trees.
An anti-Ramsey theorem on edge-cuts
Let G = (V(G), E(G)) be a connected multigraph and let h(G) be the minimum integer k such that for every edge-colouring of G, using exactly k colours, there is at least one edge-cut of G all of whose edges receive different colours. In this note it is proved that if G has at least 2 vertices and has no bridges, then h(G) = |E(G)| -|V(G)| + 2.
An Application of Circuit Polynomials to the Counting of Spanning Trees in Graphs
An application of nonprarametric Cox regression model in reliability analysis: a case study
The contribution deals with an application of the nonparametric version of Cox regression model to the analysis and modeling of the failure rate of technical devices. The objective is to recall the method of statistical analysis of such a model, to adapt it to the real–case study, and in such a way to demonstrate the flexibility of the Cox model. The goodness-of-fit of the model is tested, too, with the aid of the graphical test procedure based on generalized residuals.
An application of Ramanujan graphs to C*-algebra tensor products, II
An application of set-pair systems for multitransversals
An Approximate Method for Optimization of a Network Flow With Inverse Linear Constraints
An approximation algorithm for the total covering problem
We introduce a 2-factor approximation algorithm for the minimum total covering number problem.
An asymptotic result for the path partition conjecture.
An attractive class of bipartite graphs
In this paper we propose a structural characterization for a class of bipartite graphs defined by two forbidden induced subgraphs. We show that the obtained characterization leads to polynomial-time algorithms for several problems that are NP-hard in general bipartite graphs.
An axiomatic approach to metric properties of connected graphs
An easy proof of the limit in the random assignment problem.
An efficient algorithm for the transversal hypergraph generation.