Fast approximation of centrality.
Finding a Minimum-Weight k-Link Path in Graphs with the Concave Monge Property and Applications.
Finding all the best swaps of a minimum diameter spanning tree under transient edge failures.
Finding dominators in practice.
Finding -partitions efficiently
We study the concept of an -partition of the vertex set of a graph , which includes all vertex partitioning problems into four parts which we require to be nonempty with only external constraints according to the structure of a model graph , with the exception of two cases, one that has already been classified as polynomial, and the other one remains unclassified. In the context of more general vertex-partition problems, the problems addressed in this paper have these properties: non-list, -part,...
Finding H-partitions efficiently
We study the concept of an H-partition of the vertex set of a graph G, which includes all vertex partitioning problems into four parts which we require to be nonempty with only external constraints according to the structure of a model graph H, with the exception of two cases, one that has already been classified as polynomial, and the other one remains unclassified. In the context of more general vertex-partition problems, the problems addressed in this paper have these properties: non-list, 4-part, external...
Finding shortest paths with computational geometry.
Finding Tricyclic Graphs with a Maximal Number of Matchings - Another Example of Computer Aided Research in Graph Theory
Finite nondense point set analysis
The paper deals with the decomposition and with the boundarz and hull construction of the so-called nondense point set. This problem and its applications have been frequently studied in computational geometry, raster graphics and, in particular, in the image processing (see e.g. [3], [6], [7], [8], [9], [10]). We solve a problem of the point set decomposition by means of certain relations in graph theory.
Fixed-location circular arc drawing of planar graphs.
Formulation and solution of the sequencing problem with parallel machines
Fountains, histograms, and -identitie.
Frequency planning and ramifications of coloring
This paper surveys frequency assignment problems coming up in planning wireless communication services. It particularly focuses on cellular mobile phone systems such as GSM, a technology that revolutionizes communication. Traditional vertex coloring provides a conceptual framework for the mathematical modeling of many frequency planning problems. This basic form, however, needs various extensions to cover technical and organizational side constraints. Among these ramifications are T-coloring and...
Fully dynamic 3-dimensional orthogonal graph drawing.