The state of knowledge on cycle bases is surveyed, different kinds of cycle bases are introduced, characterized in terms of their cycle matrix, and structural results and a priori length bounds are proved.Expand

An algorithm is given to compute a rank-maximal matching with running time O(min(n + C,C &sqrt;n)m), where n is the number of applicants and posts and m is the total size of the preference lists.Expand

A 1-e approximation algorithm to compute a cycle basis which is at most 1+e times the weight of a minimum cycle basis in a graph G with m edges and n vertices.Expand

A very simple method for extracting a minimum cycle basis from the candidate set with running time O(n), which improves the running time for sparse graphs and in the undirected case by using bit-packing the authors improve theRunning time also in the case of dense graphs.Expand

It is shown how Earth Observation data, ontologies, and linked geospatial data can be combined for the development of a wildfire monitoring service that goes beyond applications currently deployed in various Earth Obs observation data centers.Expand

The two fundamentally different approaches to compute a minimum cycle basis of an undirected graph are combined to obtain a new hybrid algorithm with running time <i>O</i>, which is very efficient, in practice, for random dense unweighted graphs.Expand

An algorithm is given for computing strongly stable matchings in the hospitals-residents setting, where n is the number of vertices and m the Number of edges, where there is no blocking edge with respect to it.Expand

The design and underlying structure of JGraphT, a programming library that contains very efficient and generic graph data structures along with a large collection of state-of-the-art algorithms, is described and discussed.Expand

Improvements are obtained for the capacitated transshipment problem with polynomially bounded for the maximum weight matching problem on bipartite graphs where T and S are the time and space bound of an algorithm to sequentially enumerate the sets Ei.Expand

This work shows an efficient combinatorial algorithm based on LP duality to compute a fair matching in bipartite graphs, and shows a scaling based algorithm for the fair b-matching problem.Expand