Applications of Graph Spectra: an Introduction to the Literature
Applications of Graph Spectra: An Introduction to the Literature
Applications of Graph Spectra in Quantum Physics
Applications of mathematical programming in graceful labeling of graphs.
Applications of relaxed submodularity.
Applications of Shortest Path Algorithms to Matrix Scalings.
Applications of Topological Graph Theory for Group Theory.
Applying tabu search to determine new Ramsey graphs.
Approximating clustering coefficient and transitivity.
Approximating Euclidean Distances by Small Degree Graphs*
Approximating the isoperimetric number of strongly regular graphs.
Approximation algorithms for some graph partitioning problems.
Approximation algorithms for the design of SDH/SONET networks
In this paper, a graph partitioning problem that arises in the design of SONET/SDH networks is defined and formalized. Approximation algorithms with performance guarantees are presented. To solve this problem efficiently in practice, fast greedy algorithms and a tabu-search method are proposed and analyzed by means of an experimental study.
Approximation algorithms for the design of SDH/SONET networks
In this paper, a graph partitioning problem that arises in the design of SONET/SDH networks is defined and formalized. Approximation algorithms with performance guarantees are presented. To solve this problem efficiently in practice, fast greedy algorithms and a tabu-search method are proposed and analyzed by means of an experimental study.
Approximation algorithms for the traveling salesman problem with range condition
Approximation Algorithms for the Traveling Salesman Problem with Range Condition
We prove that the Christofides algorithm gives a approximation ratio for the special case of traveling salesman problem (TSP) in which the maximum weight in the given graph is at most twice the minimum weight for the odd degree restricted graphs. A graph is odd degree restricted if the number of odd degree vertices in any minimum spanning tree of the given graph is less than times the number of vertices in the graph. We prove that the Christofides algorithm is more efficient (in terms...
Approximation des dissimilarités par des arbres additifs
Approximations of weighted independent set and hereditary subset problems.
Arbitrarily traceable Eulerian graph has the Hamiltonian square
Arbitrarily vertex decomposable caterpillars with four or five leaves
A graph G of order n is called arbitrarily vertex decomposable if for each sequence (a₁,...,aₖ) of positive integers such that a₁+...+aₖ = n there exists a partition (V₁,...,Vₖ) of the vertex set of G such that for each i ∈ 1,...,k, induces a connected subgraph of G on vertices. D. Barth and H. Fournier showed that if a tree T is arbitrarily vertex decomposable, then T has maximum degree at most 4. In this paper we give a complete characterization of arbitrarily vertex decomposable caterpillars...